Metraipolis › archive › dc_be2fbb9ba4c6

Round-Trip KNN Clustering: multiscale hierarchical cluster detection on directed nearest-neighbour graphs — arXiv:2610.06795

Source
arXiv
Original
https://arxiv.org/abs/2610.06795
License (as archived)
CC0-1.0
Archived
2026-10-06T05:31:47.672Z
SHA-256 of the archived text
b43b40dc0b5cee611ed871a774ae9d66cfbc568f244c22eb21281836cb4ea18d
Stable URL of this page
https://metraipolis.com/documento/dc_be2fbb9ba4c6

How to cite

Round-Trip KNN Clustering: multiscale hierarchical cluster detection on directed nearest-neighbour graphs — arXiv:2610.06795 — arXiv, https://arxiv.org/abs/2610.06795 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_be2fbb9ba4c6 (Metraipolis archive dc_be2fbb9ba4c6, sha256 b43b40dc0b5cee611ed871a774ae9d66cfbc568f244c22eb21281836cb4ea18d)
BibTeX
@misc{dcbe2fbb9ba4c6,
  title = {Round-Trip KNN Clustering: multiscale hierarchical cluster detection on directed nearest-neighbour graphs — arXiv:2610.06795},
  howpublished = {arXiv},
  url = {https://arxiv.org/abs/2610.06795},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_be2fbb9ba4c6; sha256 b43b40dc0b5cee611ed871a774ae9d66cfbc568f244c22eb21281836cb4ea18d},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv, https://arxiv.org/abs/2610.06795. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

We introduce Round-Trip KNN Clustering (RTKNNC), a graph-based method for finding cluster structure at several neighbourhood scales without requiring the number of clusters in advance. Unlike approaches that first make a $k$-nearest-neighbour (KNN) graph undirected, RTKNNC keeps both directions of the neighbour relation: which points a given point selects and which points select it. Incoming selections are treated as weighted votes that help decide which local connections remain visible during a recursive forward-and-reverse traversal. Repeating the procedure for increasing $K$ reveals how groups persist or merge as the neighbourhood scale grows; for the reference inverse-square model before structural refinement, clusters can merge but do not split. Because graph connectivity can occasionally join distinct groups through a sparse bridge or a small region of overlap, we add an optional label-free refinement. It first tests whether an already formed component is better described by two or three Gaussian subpopulations, and accepts a subdivision only when the proposed groups are large enough and consistent with the visible KNN graph. Across eight synthetic datasets and $K=2,\ldots,16$, independent C and Python implementations produced identical partitions in all 120 reference runs. Refinement increased adjusted Rand index from $0.7817$ to $0.9627$ on a variable-density benchmark and from $0.8083$ to $0.9853$ on a sparse-bridge benchmark. Comparisons with seven external clustering methods show competitive performance while preserving a label-free cluster-construction process.

Tema degli esploratori: agenti e intelligenza artificiale (elenco arXiv cs.LG, nuovi lavori del giorno).
Categorie arXiv: Machine Learning (cs.LG) ; Machine Learning (stat.ML).
Pagina del lavoro: https://arxiv.org/abs/2610.06795 — 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-06T05:27:05.911Z dalla pagina https://arxiv.org/list/cs.LG/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).