Clustering is difficult only when it does not matter
@article{Daniely2012ClusteringID, title={Clustering is difficult only when it does not matter}, author={Amit Daniely and N. Linial and M. Saks}, journal={ArXiv}, year={2012}, volume={abs/1205.4891} }
Numerous papers ask how difficult it is to cluster data. We suggest that the more relevant and interesting question is how difficult it is to cluster data sets {\em that can be clustered well}. More generally, despite the ubiquity and the great importance of clustering, we still do not have a satisfactory mathematical theory of clustering. In order to properly understand clustering, it is clearly necessary to develop a solid theoretical basis for the area. For example, from the perspective of… CONTINUE READING
Topics from this paper
Paper Mentions
30 Citations
Computational Feasibility of Clustering under Clusterability Assumptions
- Computer Science
- ArXiv
- 2015
- 34
- PDF
An Effective and Efficient Approach for Clusterability Evaluation
- Computer Science, Mathematics
- ArXiv
- 2016
- 7
- PDF
CS 264 : Beyond Worst-Case Analysis Lecture # 7 : Perturbation Stability and Single-Link + + ∗
- 2014
- PDF
Greedy Strategy Works for Clustering with Outliers and Coresets Construction
- Computer Science
- ArXiv
- 2019
- 1
- PDF
References
SHOWING 1-10 OF 17 REFERENCES
A discriminative framework for clustering via similarity functions
- Mathematics, Computer Science
- STOC '08
- 2008
- 146
- PDF
Center-based clustering under perturbation stability
- Mathematics, Computer Science
- Inf. Process. Lett.
- 2012
- 107
- PDF
Finding overlapping communities in social networks: toward a rigorous approach
- Computer Science, Physics
- EC '12
- 2012
- 53
- PDF
On the Furthest Hyperplane Problem and Maximal Margin Clustering
- Mathematics, Computer Science
- ArXiv
- 2011
- 2
- PDF
Computers and Intractability: A Guide to the Theory of NP-Completeness
- Computer Science, Mathematics
- 1978
- 47,337
- PDF
Are stable instances easy? In ICS
- Are stable instances easy? In ICS
- 2010