← heapsort
RESEARCH27

AdaGraph: A Graph-Native Clustering Algorithm That Overcomes the Curse of Dimensionality and Enables Scientific Discovery

arXiv CS.LGΒ·May 19, 2026

AdaGraph is a graph-native clustering algorithm from the Structure-Centric Machine Learning (SC-ML) paradigm, which fundamentally dissolves the curse of dimensionality by replacing geometry-centric computation with topology-based computation. Operating within kNN graph topology, it requires no a priori specification of cluster numbers, handles noise, and scales effectively.

Read original β†—