NAC clusters high-dimensional data by scoring candidate partitions on a directed kNN graph with two permutation-standardized statistics that capture within-cluster enrichment and asymmetric separation.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
stat.ME 1years
2023 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
High-Dimensional Clustering via Nearest-Neighbor Asymmetry
NAC clusters high-dimensional data by scoring candidate partitions on a directed kNN graph with two permutation-standardized statistics that capture within-cluster enrichment and asymmetric separation.