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

In three linesAdaGraph is a graph-native clustering algorithm that overcomes the curse of dimensionality by operating on kNN graph topology instead of Euclidean distances. Tested on 10 synthetic benchmarks (d=10 to 5000) and three scientific domains (genomics, NLP, materials science), it outperforms HDBSCAN, WGCNA, and other methods without requiring k specification.

Summary generated by Claude — human-verified