On clusterings-good, bad and spectral
Top Cited Papers
- 8 November 2002
- proceedings article
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 367-377
- https://doi.org/10.1109/sfcs.2000.892125
Abstract
No abstract availableThis publication has 11 references indexed in Scilit:
- A sublinear time approximation scheme for clustering in metric spacesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Fast Monte-Carlo algorithms for finding low-rank approximationsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- A Constant-Factor Approximation Algorithm for the k-Median ProblemJournal of Computer and System Sciences, 2002
- Latent Semantic Indexing: A Probabilistic AnalysisJournal of Computer and System Sciences, 2000
- Incremental clustering and dynamic information retrievalPublished by Association for Computing Machinery (ACM) ,1997
- Spectral partitioning works: planar graphs and finite element meshesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1996
- Approximate counting, uniform generation and rapidly mixing Markov chainsInformation and Computation, 1989
- An approximate max-flow min-cut theorem for uniform multicommodity flow problems with applications to approximation algorithmsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1988
- A simple heuristic for the p-centre problemOperations Research Letters, 1985
- Error and Perturbation Bounds for Subspaces Associated with Certain Eigenvalue ProblemsSIAM Review, 1973