{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,15]],"date-time":"2025-12-15T15:33:27Z","timestamp":1765812807770,"version":"3.48.0"},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2021,1,23]],"date-time":"2021-01-23T00:00:00Z","timestamp":1611360000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2021,1,23]],"date-time":"2021-01-23T00:00:00Z","timestamp":1611360000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2025,11]]},"DOI":"10.1007\/s10479-021-03951-2","type":"journal-article","created":{"date-parts":[[2021,1,23]],"date-time":"2021-01-23T09:02:55Z","timestamp":1611392575000},"page":"1179-1197","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Clusters of high-dimensional interval data and related Boolean functions of events in Euclidean space"],"prefix":"10.1007","volume":"354","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1358-5322","authenticated-orcid":false,"given":"Jinwook","family":"Lee","sequence":"first","affiliation":[]},{"given":"Andr\u00e1s","family":"Pr\u00e9kopa","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,1,23]]},"reference":[{"key":"3951_CR1","doi-asserted-by":"publisher","first-page":"1057","DOI":"10.1509\/jmr.08.0468","volume":"48","author":"A Agarwal","year":"2008","unstructured":"Agarwal, A., Hosanagar, K., & Smith, M. (2008). Location, location, location: An analysis of profitability of position in online advertising markets. Journal of Marketing Research, 48, 1057\u20131073.","journal-title":"Journal of Marketing Research"},{"key":"3951_CR2","volume-title":"Laws of thought","author":"G Boole","year":"1854","unstructured":"Boole, G. (1854). Laws of thought. New York: Dover."},{"key":"3951_CR3","unstructured":"Boole, G. (1868). Of propositions numerically definite. Trans Cambridge Philos Soc, Part II, XI pp 396\u2013411."},{"key":"3951_CR4","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1287\/moor.14.2.317","volume":"14","author":"E Boros","year":"1989","unstructured":"Boros, E., & Pr\u00e9kopa, A. (1989). Closed form two-sided bounds for probabilities that exactly $$r$$ and at least $$r$$ out of $$n$$ events occur. Mathematics of Operations Research, 14, 317\u2013342.","journal-title":"Mathematics of Operations Research"},{"issue":"4","key":"3951_CR5","doi-asserted-by":"publisher","first-page":"1311","DOI":"10.1287\/moor.2014.0657","volume":"39","author":"E Boros","year":"2014","unstructured":"Boros, E., Scozzari, A., Tardella, F., & Veneziani, P. (2014). Polynomially computable bounds for the probability of the union of events. Mathematics of Operations Research, 39(4), 1311\u20131329.","journal-title":"Mathematics of Operations Research"},{"key":"3951_CR6","doi-asserted-by":"publisher","DOI":"10.1017\/9781108583664","volume-title":"Introduction to applied linear algebra","author":"S Boyd","year":"2018","unstructured":"Boyd, S., & Vandenberghe, L. (2018). Introduction to applied linear algebra. Cambridge: Cambridge University Press."},{"issue":"1","key":"3951_CR7","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1287\/moor.26.1.174.10596","volume":"26","author":"J Buksz\u00e1r","year":"2001","unstructured":"Buksz\u00e1r, J., & Pr\u00e9kopa, A. (2001). Probability bounds with cherry trees. Mathematics of Operations Research, 26(1), 174\u2013192.","journal-title":"Mathematics of Operations Research"},{"key":"3951_CR8","first-page":"69","volume":"19","author":"J Buksz\u00e1r","year":"2001","unstructured":"Buksz\u00e1r, J., & Sz\u00e1ntai, T. (2001). Probability bounds given by hypercherry trees. Alkalmaz Mat Lapok, 19, 69\u201385.","journal-title":"Alkalmaz Mat Lapok"},{"key":"3951_CR9","doi-asserted-by":"crossref","unstructured":"Chan, T. M. (2011). Persistent predecessor search and orthogonal point location on the word ram. In SODA \u201911.","DOI":"10.1137\/1.9781611973082.85"},{"key":"3951_CR10","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1080\/00029890.1965.11970533","volume":"72","author":"T Hailperin","year":"1965","unstructured":"Hailperin, T. (1965). Best possible inequalities for the probability of a logical function of events. The American Mathematical Monthly, 72, 343\u2013359.","journal-title":"The American Mathematical Monthly"},{"key":"3951_CR11","doi-asserted-by":"publisher","first-page":"597","DOI":"10.2307\/3212481","volume":"13","author":"D Hunter","year":"1976","unstructured":"Hunter, D. (1976). Bounds for the probability of a union. Journal of Applied Probability, 13, 597\u2013603.","journal-title":"Journal of Applied Probability"},{"key":"3951_CR12","unstructured":"Iacono, J., & Langerman, S. (2000). Dynamic point location in fat hyperrectangles with integer coordinates. In CCCG."},{"key":"3951_CR13","first-page":"109","volume":"12","author":"C Jordan","year":"1867","unstructured":"Jordan, C. (1867). M\u00e9moire sur la r\u00e9solution alg\u00e9brique des \u00e9quations. Journal de Math\u00e9matiques pures et appliqu\u00e9es, 12, 109\u2013157.","journal-title":"Journal de Math\u00e9matiques pures et appliqu\u00e9es"},{"key":"3951_CR14","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1090\/S0002-9939-1956-0078686-7","volume":"7","author":"J Kruskal","year":"1956","unstructured":"Kruskal, J. (1956). On the shortest spanning subtree of a graph and the traveling salesman problem. Proceedings of the American Mathematical Society, 7, 48\u201350.","journal-title":"Proceedings of the American Mathematical Society"},{"issue":"3","key":"3951_CR15","doi-asserted-by":"publisher","first-page":"242","DOI":"10.1016\/j.orl.2017.03.007","volume":"45","author":"J Lee","year":"2017","unstructured":"Lee, J. (2017). Computing the probability of union in the $$n$$-dimensional Euclidean space for application of the multivariate quantile: $$p$$-level efficient points. Operations Research Letters, 45(3), 242\u2013247.","journal-title":"Operations Research Letters"},{"key":"3951_CR16","doi-asserted-by":"publisher","unstructured":"Lee, J., & Choi, P. M. S. (2020). Chain of Antichains: An efficient and secure distributed ledger, Springer Singapore, Singapore, pp 19\u201358. https:\/\/doi.org\/10.1007\/978-981-15-2205-5_2.","DOI":"10.1007\/978-981-15-2205-5_2"},{"key":"3951_CR17","doi-asserted-by":"publisher","DOI":"10.1007\/s10479-019-03366-0","author":"J Lee","year":"2019","unstructured":"Lee, J., & Kim, J. (2019). Partially ordered data sets and a new efficient method for calculating multivariate conditional value-at-risk. Annals of Operations Research,. https:\/\/doi.org\/10.1007\/s10479-019-03366-0.","journal-title":"Annals of Operations Research"},{"issue":"1","key":"3951_CR18","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1016\/j.orl.2016.11.001","volume":"45","author":"J Lee","year":"2017","unstructured":"Lee, J., & Pr\u00e9kopa, A. (2017). On the probability of union in the n-space. Operations Research Letters, 45(1), 19\u201324.","journal-title":"Operations Research Letters"},{"key":"3951_CR19","doi-asserted-by":"publisher","first-page":"85705","DOI":"10.1109\/ACCESS.2019.2924425","volume":"7","author":"A Miklosik","year":"2019","unstructured":"Miklosik, A., Kuchta, M., Evans, N., & Zak, S. (2019). Towards the adoption of machine learning-based analytical tools in digital marketing. IEEE Access, 7, 85705\u201385718.","journal-title":"IEEE Access"},{"key":"3951_CR20","unstructured":"Pelleg, D., & Moore, A. (2001). Mixtures of rectangles: Interpretable soft clustering. In ICML."},{"issue":"1","key":"3951_CR21","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1287\/opre.36.1.145","volume":"36","author":"A Pr\u00e9kopa","year":"1988","unstructured":"Pr\u00e9kopa, A. (1988). Boole\u2013Bonferroni inequalities and linear programming. Operational Research, 36(1), 145\u2013162.","journal-title":"Operational Research"},{"issue":"2","key":"3951_CR22","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1287\/opre.38.2.227","volume":"38","author":"A Pr\u00e9kopa","year":"1990","unstructured":"Pr\u00e9kopa, A. (1990a). Sharp bounds on probabilities using linear programming. Operational Research, 38(2), 227\u2013239.","journal-title":"Operational Research"},{"key":"3951_CR23","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1016\/0166-218X(90)90068-N","volume":"27","author":"A Pr\u00e9kopa","year":"1990","unstructured":"Pr\u00e9kopa, A. (1990b). The discrete moment problem and linear programming. Discrete Applied Mathematics, 27, 235\u2013254.","journal-title":"Discrete Applied Mathematics"},{"key":"3951_CR24","doi-asserted-by":"publisher","DOI":"10.1007\/978-94-017-3087-7","volume-title":"Stochastic programming","author":"A Pr\u00e9kopa","year":"1995","unstructured":"Pr\u00e9kopa, A. (1995). Stochastic programming. Amsterdam: Kluwer Academic Publishers."},{"key":"3951_CR25","first-page":"267","volume":"10","author":"A Pr\u00e9kopa","year":"2003","unstructured":"Pr\u00e9kopa, A. (2003). Probabilistic programming. Hand books in Operations Research and Management Science (Ruszczy\u0144ski, A and Shapiro, A, Eds), 10, 267\u2013351.","journal-title":"Hand books in Operations Research and Management Science (Ruszczy\u0144ski, A and Shapiro, A, Eds)"},{"key":"3951_CR26","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1016\/j.dam.2018.03.012","volume":"244","author":"A Scozzari","year":"2018","unstructured":"Scozzari, A., & Tardella, F. (2018). Complexity of some graph-based bounds on the probability of a union of events. Discrete Applied Mathematics, 244, 186\u2013197.","journal-title":"Discrete Applied Mathematics"},{"key":"3951_CR27","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1016\/j.patrec.2003.10.016","volume":"25","author":"R Souza","year":"2004","unstructured":"Souza, R., & Carvalho, F. (2004). Clustering of interval data based on city-block distances. Pattern Recognition Letters, 25, 353\u2013365.","journal-title":"Pattern Recognition Letters"},{"key":"3951_CR28","unstructured":"Strang, G. (2019). Linear Algebra and Learning from Data. Wellesley - Cambridge Press."},{"key":"3951_CR29","unstructured":"Suzuki, S., & Ibaraki, T. (2004). An average running time analysis of a backtracking algorithm to calculate the measure of the union of hyperrectangles in $$d$$ dimensions. In CCCG."},{"key":"3951_CR30","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1093\/biomet\/69.2.297","volume":"69","author":"K Worsley","year":"1982","unstructured":"Worsley, K. (1982). An improved Bonferroni inequality and applications. Biometrika, 69, 297\u2013302.","journal-title":"Biometrika"},{"key":"3951_CR31","doi-asserted-by":"publisher","first-page":"1300","DOI":"10.1109\/TKDE.2005.145","volume":"17","author":"Y Yang","year":"2005","unstructured":"Yang, Y., & Padmanabhan, B. (2005). Ghic: A hierarchical pattern-based clustering algorithm for grouping web transactions. IEEE Transactions on Knowledge and Data Engineering, 17, 1300\u20131304.","journal-title":"IEEE Transactions on Knowledge and Data Engineering"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-021-03951-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10479-021-03951-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-021-03951-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,15]],"date-time":"2025-12-15T15:29:29Z","timestamp":1765812569000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10479-021-03951-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,1,23]]},"references-count":31,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2025,11]]}},"alternative-id":["3951"],"URL":"https:\/\/doi.org\/10.1007\/s10479-021-03951-2","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"type":"print","value":"0254-5330"},{"type":"electronic","value":"1572-9338"}],"subject":[],"published":{"date-parts":[[2021,1,23]]},"assertion":[{"value":"13 January 2021","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 January 2021","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}