Logo image
Clusters of high-dimensional interval data and related Boolean functions of events in Euclidean space
Journal article   Peer reviewed

Clusters of high-dimensional interval data and related Boolean functions of events in Euclidean space

Jinwook Lee and Andras Prekopa
Annals of operations research
23 Jan 2021

Abstract

Operations Research & Management Science Science & Technology Technology
Clustering interval data has been studied for decades. High-dimensional interval data can be expressed in terms of hyperrectangles in R-d (or d-orthotopes) in case of real-valued d-attributes data. This paper investigates such high-dimensional interval data: the Cartesian product of intervals, or a vector of interval. For the efficient computation of related Boolean functions, some interesting aspects have been discovered using vertices and edges of the graph, generated from given events. We also study the lower and upper-bounded orthants in R-d as events for which we show the existence of a polynomial-time algorithm to calculate the probability of the union of such events. This efficient algorithm has been discovered by constructing a suitable partial order relation based on a recursive projection onto lowerdimensional spaces. Illustrative real-life applications are presented.

Metrics

13 Record Views

Details

UN Sustainable Development Goals (SDGs)

This publication has contributed to the advancement of the following goals:

#3 Good Health and Well-Being

InCites Highlights

Data related to this publication, from InCites Benchmarking & Analytics tool:

Collaboration types
Domestic collaboration
Web of Science research areas
Operations Research & Management Science
Logo image