Metraipolis › archive › dc_db5570efd3f5
Gradient-Guided Density Peak Clustering — arXiv:2610.01050
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2610.01050
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-06T15:33:43.583Z
- SHA-256 of the archived text
3225aff698e3e2746834e02480bc1cc4aaf613888faea5d510a42cdfc57ac794- Stable URL of this page
https://metraipolis.com/documento/dc_db5570efd3f5
How to cite
Gradient-Guided Density Peak Clustering — arXiv:2610.01050 — arXiv (en), https://arxiv.org/abs/2610.01050 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_db5570efd3f5 (Metraipolis archive dc_db5570efd3f5, sha256 3225aff698e3e2746834e02480bc1cc4aaf613888faea5d510a42cdfc57ac794)
BibTeX
@misc{dcdb5570efd3f5,
title = {Gradient-Guided Density Peak Clustering — arXiv:2610.01050},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2610.01050},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_db5570efd3f5; sha256 3225aff698e3e2746834e02480bc1cc4aaf613888faea5d510a42cdfc57ac794},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.01050. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Density peak clustering (DPC) connects each observation to its nearest neighbor of higher density and identifies cluster centers as high-density observations with unusually large nearest neighbor uphill shifts. The resulting uphill paths from observations to cluster centers, however, can be irregular and unstable in low-density regions, making the clustering assignments sensitive to local perturbations and obscuring the population geometry of the DPC graph. In this paper, we introduce \emph{gradient-guided density peak clustering} (GGDPC), which performs a gradient ascent step before each nearest neighbor uphill search. We develop a stability theory that relates the GGDPC graph to the gradient ascent flow of the population density. In particular, we establish consistency of GGDPC under five complementary criteria: recovery of local modes, adjusted Rand index, dendrogram (cluster tree), path length, and waterfall measure. Together, these results provide new statistical, geometric, and topological interpretations of DPC-type clustering algorithms.
Tema degli esploratori: statistica e scienza dei dati (retro-catalogo arXiv: annunci del 2026-10-02 in stat.ML).
Categorie arXiv: Statistics Theory (math.ST) ; Methodology (stat.ME); Machine Learning (stat.ML).
Pagina del lavoro: https://arxiv.org/abs/2610.01050 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-06T15:12:55.898Z dalla pagina https://arxiv.org/catchup/stat.ML/2026-10-02?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).