# Automatic topography of high-dimensional data sets by non-parametric Density Peak clustering

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

## Key facts

- Cited by 15 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 28 Feb 2018.

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

- [DADApy: Distance-based Analysis of DAta-manifolds in Python](https://mlsanity.com/paper/2205.03373/) (2022)
- [The representation landscape of few-shot learning and fine-tuning in large language models](https://mlsanity.com/paper/2409.03662/) (2024)
- [Massive Supervised Fine-tuning Experiments Reveal How Data, Layer, and Training Factors Shape LLM Alignment Quality](https://mlsanity.com/paper/2506.14681/) (2025)
- [Automatic feature selection and weighting in molecular systems using Differentiable Information Imbalance](https://mlsanity.com/paper/2411.00851/) (2024)
- [The Narrow Gate: Localized Image-Text Communication in Native Multimodal Models](https://mlsanity.com/paper/2412.06646/) (2024)
- [Git: Clustering Based on Graph of Intensity Topology](https://mlsanity.com/paper/2110.01274/) (2021)
- [PECANN: Parallel Efficient Clustering with Graph-Based Approximate Nearest Neighbor Search](https://mlsanity.com/paper/2312.03940/) (2023)
- [Scale adaptive and robust intrinsic dimension estimation via optimal neighbourhood identification](https://mlsanity.com/paper/2405.15132/) (2024)
- [VDPC: Variational Density Peak Clustering Algorithm](https://mlsanity.com/paper/2201.00641/) (2021)
- [Detecting Localized Density Anomalies in Multivariate Data via Coin-Flip Statistics](https://mlsanity.com/paper/2503.23927/) (2025)
- [A density peaks clustering algorithm with sparse search and K-d tree](https://mlsanity.com/paper/2203.00973/) (2022)
- [Density Estimation via Binless Multidimensional Integration](https://mlsanity.com/paper/2407.08094/) (2024)
- [LGBQPC: Local Granular-Ball Quality Peaks Clustering](https://mlsanity.com/paper/2505.11359/) (2025)
- [Coupled reaction and diffusion governing interface evolution in solid-state batteries](https://mlsanity.com/paper/2506.10944/) (2025)
- [Towards Robust and Scalable Density-based Clustering via Graph Propagation](https://mlsanity.com/paper/2605.00390/) (2026)

## Abstract (arXiv)

Data analysis in high-dimensional spaces aims at obtaining a synthetic description of a data set, revealing its main structure and its salient features. We here introduce an approach providing this description in the form of a topography of the data, namely a human-readable chart of the probability density from which the data are harvested. The approach is based on an unsupervised extension of Density Peak clustering and a non-parametric density estimator that measures the probability density in the manifold containing the data. This allows finding automatically the number and the height of the peaks of the probability density, and the depth of the "valleys" separating them. Importantly, the density estimator provides a measure of the error, which allows distinguishing genuine density peaks from density fluctuations due to finite sampling. The approach thus provides robust and visual information about the density peaks' height, their statistical reliability, and their hierarchical organization, offering a conceptually powerful extension of the standard clustering partitions. We show that this framework is particularly useful in the analysis of complex data sets.