arXiv Machine Learning By Kai Ming Ting, Kaifeng Zhang, Sanjay Chawla

Why does Greedy Search produce Optimal Clustering Outcomes? A Fixed-Core Assignment Theory

Read the original on arXiv Machine Learning →

arXiv:2607. 24237v1 Announce Type: new Abstract: Many existing clustering methods are designed based on a set-oriented definition---a cluster is a set of similar points---relying a point-to-point similarity function to find similar points.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Machine Learning.

arXiv AI
Sep 17

Universal NP-Hardness of Clustering under General Utilities

The paper introduces the Universal Clustering Problem (UCP), a framework that captures the optimisation core common to many clustering methods by maximizing a polynomial‑time computable partition utility over a finite metric space. It proves UCP is NP‑hard through reductions from graph colouring and exact cover by 3‑sets, showing that popular algorithms such as k‑means, GMMs, DBSCAN, spectral clustering, and affinity propagation inherit this intractability. The authors argue that this unified hardness explains typical failure modes—like local optima and greedy merge traps—and suggest moving toward stability‑aware objectives and interaction‑driven formulations with explicit guarantees.

By Angshul Majumdar
arXiv Machine Learning
Sep 17

Bracketing Uncertainty in Clustering Under the Manifold Hypothesis

The paper formalizes a geometric tradeoff between ambient separation and sampling gaps to determine when distinct manifold components can be reliably separated in clustering. It introduces a threshold phenomenon for mutual‑k‑nearest‑neighbor graphs, defining an uncertainty zone where the number of clusters cannot be identified. The authors propose Manifold‑Based Clustering (MBC), which outputs a bracket interval quantifying this uncertainty rather than forcing a single cluster count.

By Savik Kinger, Luciano Dyballa, Steven W. Zucker