# Clustering for high-dimension, low-sample size data using distance vectors

arXiv: https://arxiv.org/abs/1312.3386 · HTML: https://mlsanity.com/paper/1312.3386/

## Key facts

- Cited by 1 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 12 Dec 2013.

## Built on by (most cited first, 1 of 1)

- [Few-Example Clustering via Contrastive Learning](https://mlsanity.com/paper/2207.04050/) (2022)

## Abstract (arXiv)

In high-dimension, low-sample size (HDLSS) data, it is not always true that closeness of two objects reflects a hidden cluster structure. We point out the important fact that it is not the closeness, but the "values" of distance that contain information of the cluster structure in high-dimensional space. Based on this fact, we propose an efficient and simple clustering approach, called distance vector clustering, for HDLSS data. Under the assumptions given in the work of Hall et al. (2005), we show the proposed approach provides a true cluster label under milder conditions when the dimension tends to infinity with the sample size fixed. The effectiveness of the distance vector clustering approach is illustrated through a numerical experiment and real data analysis.