Round-Trip KNN Clustering: multiscale hierarchical cluster detection on directed nearest-neighbour graphs
Paper recorded by Signals 4 on 2026-10-05 in cs.LG. Abstract reproduced from arXiv; link to the original below.
Published 2026-10-05 on arXiv · recorded by Signals 4 on 2026-10-06
Category: cs.LG · 机器学习 · first seen 2026-10-06
Abstract
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 selec
Read on arXiv →
Cite this page: Round-Trip KNN Clustering: multiscale hierarchical cluster detection on directed nearest-neighbour graphs: the #379 most recent of 762 cs.LG papers we have recorded (as of 2026-10-05). Source: Signals 4 (Signals API) — https://data.jiangzhang.ca/signals4/t/papers/round-trip-knn-clustering-multiscale-hierarchical-cluster-detection-on-directed-.html
Free to quote with attribution to “Signals 4 (Signals API)”. Machine-readable:
papers.json
Get 4 AI signals a day by email — free.
Get 4 AI signals a day by email — free