Models high-dimensional data clustering in binary form, suggesting simpler representation methods.
Recent experiments have uncovered that several high-dimensional datasets have a high probability of forming binary clusters after projecting the data on a randomly chosen one-dimensional subspace. This paper presents a probability model for the high-dimensional data that could explain this phenomenon. The model consists of several Bernoulli random variables which describe a parallelotope frame. The parallelotope forms a skeleton on which noise can be added. While clusters in high dimension are difficult to observe or may not exist at all, the groupings of sample points drawn from such a distribution can be easily identified. Such groupings can be used in place of clustering, especially when the dataset is small, and the statistical significance of these groups can be tested. The existence of such structure in the underlying probability model of a dataset allows for semantic grouping of datapoints based on different criteria. More generally, it provides a simple, binary representation for data points where each bit represents the group membership for each criterion, which could potentially be used for data compression.
No takes yet. Share an insight, caveat, or question.
Boutin et al. (2026) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: