The DOI matches its Crossref record; 19 of the 19 references it cites were found in a registry or an index.
LIMBO: Scalable Clustering of Categorical Data
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
Cites
(1979) · Cited by 43,841
Elements of Information Theory
Cover, T. M., & Thomas, J. A. (2001) · Wiley eBooks · doi:10.1002/0471200611 · Cited by 36,808
BIRCH: an efficient data clustering method for very large databases
Zhang, T., Ramakrishnan, R., & Livny, M. (1996) · Proceedings of the 1996 ACM SIGMOD international conference on Management of data - SIGMOD '96 · doi:10.1145/233269.233324 · Cited by 3,935
The information bottleneck method
Tishby, N., Pereira, F. C., & Bialek, W. (2000) · arXiv · doi:10.48550/arxiv.physics/0004057 · Cited by 2,626 · cited 2×
“This intuitive idea was formalized by Tishby, Pereira and Bialek [20].”
MethodAuthoritative sources in a hyperlinked environment
Kleinberg, J. M. (1998) · Symposium on Discrete Algorithms · doi:10.5555/314613.315045 · Cited by 1,814
A robust and scalable clustering algorithm for mixed type attributes in large database environment
Chiu, T., Fang, D., Chen, J., Wang, Y., & Jeris, C. (2001) · Proceedings of the seventh ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/502512.502549 · Cited by 724
ROCK: a robust clustering algorithm for categorical attributes
Guha, S., Rastogi, R., & Shim, K. (1999) · Proceedings 15th International Conference on Data Engineering (Cat. No.99CB36337) · doi:10.1109/icde.1999.754967 · Cited by 609
An Efficient Data Clustering Method for Very Large Databases
Zhang, T. (1996) · Medical Entomology and Zoology · Cited by 494
Document clustering using word clusters via the information bottleneck method
Slonim, N., & Tishby, N. (2000) · Proceedings of the 23rd annual international ACM SIGIR conference on Research and development in information retrieval · doi:10.1145/345508.345578 · Cited by 474
CACTUS—clustering categorical data using summaries
Ganti, V., Gehrke, J., & Ramakrishnan, R. (1999) · Proceedings of the fifth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/312129.312201 · Cited by 469
Cited by
Gionis, A., Mannila, H., & Tsaparas, P. (2007) · ACM Transactions on Knowledge Discovery from Data · doi:10.1145/1217299.1217303 · Cited by 819
Self-citationA k-mean clustering algorithm for mixed numeric and categorical data
Ahmad, A., & Dey, L. (2007) · Data & Knowledge Engineering · doi:10.1016/j.datak.2007.03.016 · Cited by 718
Aggarwal, C. C. (2015) · Data Mining · doi:10.1007/978-3-319-14142-8_13 · Cited by 606
A Survey of Text Clustering Algorithms
Aggarwal, C. C., & Zhai, C. (2012) · Mining Text Data · doi:10.1007/978-1-4614-3223-4_4 · Cited by 581
Link analysis ranking: algorithms, theory, and experiments
Borodin, A., Roberts, G. O., Rosenthal, J. S., & Tsaparas, P. (2005) · ACM Transactions on Internet Technology · doi:10.1145/1052934.1052942 · Cited by 308
Self-citation
Metadata
- Authors
- Andritsos, P., Tsaparas, P., Miller, R. J., & Sevcik, K. C.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2004
- Pages
- 123-146
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- OpenAlex
- W1560541823
- Cited by
- 261
- References
- 19
- FWCI
- 8.46
- Type
- conference paper
- 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: LIMBO: Scalable Clustering of Categorical Data. https://app.cochat.ai/papers/10.1007/978-3-540-24741-8_9
- The paper
- Andritsos, P., Tsaparas, P., Miller, R. J., & Sevcik, K. C. (2004). LIMBO: Scalable Clustering of Categorical Data. Lecture Notes in Computer Science. https://doi.org/10.1007/978-3-540-24741-8_9
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.