The DOI matches its Crossref record; 13 of the 13 references it cites were found in a registry or an index.
On clusterings: Good, bad and spectral
Abstract
We motivate and develop a natural bicriteria measure for assessing the quality of a clustering that avoids the drawbacks of existing measures. A simple recursive heuristic is shown to have poly-logarithmic worst-case guarantees under the new measure. The main result of the article is the analysis of a popular spectral algorithm. One variant of spectral clustering turns out to have effective worst-case guarantees; another finds a "good" clustering, if one exists.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
(1979) · Cited by 43,841
Normalized cuts and image segmentation
Shi, J., & Malik, J. (2000) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.868688 · Cited by 15,502
Co-clustering documents and words using bipartite spectral graph partitioning
Dhillon, I. S. (2001) · Proceedings of the seventh ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/502512.502550 · Cited by 1,697
Latent semantic indexing: a probabilistic analysis
Papadimitriou, C. H., Tamaki, H., Raghavan, P., & Vempala, S. (1998) · Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems · doi:10.1145/275487.275505 · Cited by 863
Self-citationMulticommodity max-flow min-cut theorems and their use in designing approximation algorithms
Leighton, T., & Rao, S. (1999) · Journal of the ACM · doi:10.1145/331524.331526 · Cited by 820
Approximate counting, uniform generation and rapidly mixing Markov chains
Sinclair, A., & Jerrum, M. (1989) · Information and Computation · doi:10.1016/0890-5401(89)90067-9 · Cited by 735
Segmentation using eigenvectors: a unifying view
Weiss, Y. (1999) · Proceedings of the Seventh IEEE International Conference on Computer Vision · doi:10.1109/iccv.1999.790354 · Cited by 729
Error and Perturbation Bounds for Subspaces Associated with Certain Eigenvalue Problems
Stewart, G. W. (1973) · SIAM Review · doi:10.1137/1015095 · Cited by 573
Latent Semantic Indexing: A Probabilistic Analysis
Papadimitriou, C. H., Raghavan, P., Tamaki, H., & Vempala, S. (2000) · Journal of Computer and System Sciences · doi:10.1006/jcss.2000.1711 · Cited by 556
Self-citationIncremental clustering and dynamic information retrieval
Charikar, M., Chekuri, C., Feder, T., & Motwani, R. (1997) · Proceedings of the twenty-ninth annual ACM symposium on Theory of computing - STOC '97 · doi:10.1145/258533.258657 · Cited by 354
Cited by
A tutorial on spectral clustering
von Luxburg, U. (2007) · Statistics and Computing · doi:10.1007/s11222-007-9033-z · Cited by 10,349
Leskovec, J., Lang, K. J., Dasgupta, A., & Mahoney, M. W. (2009) · Internet Mathematics · doi:10.1080/15427951.2009.10129177 · Cited by 1,872
Schaeffer, S. E. (2007) · Computer Science Review · doi:10.1016/j.cosrev.2007.05.001 · Cited by 1,639
Local Graph Partitioning using PageRank Vectors
Andersen, R., Chung, F., & Lang, K. (2006) · 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06) · doi:10.1109/focs.2006.44 · Cited by 967
Empirical comparison of algorithms for network community detection
Leskovec, J., Lang, K. J., & Mahoney, M. (2010) · Proceedings of the 19th international conference on World wide web · doi:10.1145/1772690.1772755 · Cited by 918
Statistical properties of community structure in large social and information networks
Leskovec, J., Lang, K. J., Dasgupta, A., & Mahoney, M. W. (2008) · Proceedings of the 17th international conference on World Wide Web · doi:10.1145/1367497.1367591 · Cited by 860
A survey of kernel and spectral methods for clustering
Filippone, M., Camastra, F., Masulli, F., & Rovetta, S. (2008) · Pattern Recognition · doi:10.1016/j.patcog.2007.05.018 · Cited by 827
Semi-Supervised Learning on Riemannian Manifolds
Belkin, M., & Niyogi, P. (2004) · Machine Learning · doi:10.1023/b:mach.0000033120.25363.1e · Cited by 781
You are who you know: inferring user profiles in online social networks
Mislove, A., Viswanath, B., Gummadi, K. P., & Druschel, P. (2010) · Proceedings of the third ACM international conference on Web search and data mining · doi:10.1145/1718487.1718519 · Cited by 668
Community detection in Social Media: Performance and application considerations
Papadopoulos, S., Kompatsiaris, Y., Vakali, A., & Spyridonos, P. (2012) · Data Mining and Knowledge Discovery · doi:10.1007/s10618-011-0224-z · Cited by 615
Graph mining: Laws, generators, and algorithms
Chakrabarti, D., & Faloutsos, C. (2006) · ACM Computing Surveys · doi:10.1145/1132952.1132954 · Cited by 609
Fast approximate spectral clustering
Yan, D., Huang, L., & Jordan, M. I. (2009) · Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1557019.1557118 · Cited by 474
Towards a theoretical foundation for Laplacian-based manifold methods
Belkin, M., & Niyogi, P. (2008) · Journal of Computer and System Sciences · doi:10.1016/j.jcss.2007.08.006 · Cited by 464
Networks and the Epidemiology of Infectious Disease
Danon, L., Ford, A. P., House, T., Jewell, C. P., Keeling, M. J., Roberts, G. O., Ross, J. V., & Vernon, M. C. (2011) · Interdisciplinary Perspectives on Infectious Diseases · doi:10.1155/2011/284909 · Cited by 454
Spectral Sparsification of Graphs
Spielman, D. A., & Teng, S.-H. (2011) · SIAM Journal on Computing · doi:10.1137/08074489x · Cited by 409
Detecting network communities: a new systematic and efficient algorithm
Donetti, L., & Muñoz, M. A. (2004) · Journal of Statistical Mechanics: Theory and Experiment · doi:10.1088/1742-5468/2004/10/p10012 · Cited by 374
Fuzzy spectral clustering by PCCA+: application to Markov state models and data classification
Röblitz, S., & Weber, M. (2013) · Advances in Data Analysis and Classification · doi:10.1007/s11634-013-0134-6 · Cited by 371
A Comprehensive Survey on Community Detection With Deep Learning
Su, X., Xue, S., Liu, F., Wu, J., Yang, J., Zhou, C., Hu, W., Paris, C., Nepal, S., Jin, D., et al. (2024) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2021.3137396 · Cited by 353
Camacho, D., Panizo-LLedot, Á., Bello-Orgaz, G., Gonzalez-Pardo, A., & Cambria, E. (2020) · Information Fusion · doi:10.1016/j.inffus.2020.05.009 · Cited by 329
Spielman, D. A., & Teng, S.-H. (2013) · SIAM Journal on Computing · doi:10.1137/080744888 · Cited by 316
Blum, A., Hopcroft, J., & Kannan, R. (2020) · Cambridge University Press eBooks · doi:10.1017/9781108755528 · Cited by 304
Self-citationIntroduction to Property Testing
Goldreich, O. (2017) · Cambridge University Press eBooks · doi:10.1017/9781108135252 · Cited by 270
An Evolutionary Multiobjective Approach for Community Discovery in Dynamic Networks
Folino, F., & Pizzuti, C. (2014) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2013.131 · Cited by 265
Filtering spam with behavioral blacklisting
Ramachandran, A., Feamster, N., & Vempala, S. (2007) · Proceedings of the 14th ACM conference on Computer and communications security · doi:10.1145/1315245.1315288 · Cited by 264
Self-citationThe heat kernel as the pagerank of a graph
Chung, F. (2007) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0708838104 · Cited by 254
Movshovitz-Attias, D., Movshovitz-Attias, Y., Steenkiste, P., & Faloutsos, C. (2013) · Proceedings of the 2013 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining · doi:10.1145/2492517.2500242 · Cited by 141
Provable Guarantees for Self-Supervised Deep Learning with Spectral Contrastive Loss
HaoChen, J. Z., Wei, C., Gaidon, A., & Ma, T. (2021) · arXiv · doi:10.48550/arxiv.2106.04156 · Cited by 53
Metadata
- Authors
- Kannan, R., Vempala, S., & Vetta, A.
- Venue
- Journal of the ACM
- Published
- 2004-05
- Volume
- 51
- Issue
- 3
- Pages
- 497-515
- ISSN
- 0004-5411 (ISSN-L)
- 1557-735X
- OpenAlex
- W2034331023
- Cited by
- 834
- References
- 13
- FWCI
- 34.57
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.