Skip to content

1 paper indexed here

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

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 · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.