The DOI matches its Crossref record.
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.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Cited by
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
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
Spielman, D. A., & Teng, S.-H. (2013) · SIAM Journal on Computing · doi:10.1137/080744888 · Cited by 316
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-citation
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
- 0
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: On clusterings: Good, bad and spectral. https://app.cochat.ai/papers/10.1145/990308.990313
- The paper
- Kannan, R., Vempala, S., & Vetta, A. (2004). On clusterings: Good, bad and spectral. Journal of the ACM. https://doi.org/10.1145/990308.990313
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.
