Jul 2026
Why does Greedy Search produce Optimal Clustering Outcomes? A Fixed-Core Assignment Theory
This is the first analysis that explains why CaD clustering via greedy search can discover clusters of arbitrary shapes, densities and sizes when the estimated cluster embeddings faithfully approximate the underlying cluster distributions.
Kai-Feng Zhang, Kai-Ming Ting, Sanjay Chawla
· arXiv.org · 0 citations