The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
ROCK: a robust clustering algorithm for categorical attributes
Abstract
We study clustering algorithms for data with Boolean and categorical attributes. We show that traditional clustering algorithms that use distances between points for clustering are not appropriate for Boolean and categorical attributes. Instead, we propose a novel concept of links to measure the similarity/proximity between a pair of data points. We develop a robust hierarchical clustering algorithm, ROCK, that employs links and not distances when merging clusters. Our methods naturally extend to non-metric similarity measures that are relevant in situations where a domain expert/similarity table is the only source of knowledge. In addition to presenting detailed complexity results for ROCK, we also conduct an experimental study with real-life as well as synthetic data sets. Our study shows that ROCK not only generates better quality clusters than traditional algorithms, but also exhibits good scalability properties.
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
BIRCH: an efficient data clustering method for very large databases
Zhang, T., Ramakrishnan, R., & Livny, M. (1996) · ACM SIGMOD Record · doi:10.1145/235968.233324 · Cited by 2,097
Cited by
On Clustering Validation Techniques
Halkidi, M., Batistakis, Y., & Vazirgiannis, M. (2001) · Journal of Intelligent Information Systems · doi:10.1023/a:1012801612483 · Cited by 2,646
Chameleon: hierarchical clustering using dynamic modeling
Karypis, G., Han, E.-H., & Kumar, V. (1999) · Computer · doi:10.1109/2.781637 · Cited by 2,097
A Comprehensive Survey of Clustering Algorithms
Xu, D., & Tian, Y. (2015) · Annals of Data Science · doi:10.1007/s40745-015-0040-1 · Cited by 1,939
A 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
Cluster center initialization algorithm for K-means clustering
Khan, S. S., & Ahmad, A. (2004) · Pattern Recognition Letters · doi:10.1016/j.patrec.2004.04.007 · Cited by 685
Metadata
- Authors
- Guha, S., Rastogi, R., & Shim, K.
- Venue
- Proceedings 15th International Conference on Data Engineering (Cat. No.99CB36337)
- Publisher
- IEEE
- Published
- 1999
- Pages
- 512-521
- ISSN
- 1084-4627 (ISSN-L)
- OpenAlex
- W2099581008
- Cited by
- 609
- References
- 1
- FWCI
- 12.73
- 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: ROCK: a robust clustering algorithm for categorical attributes. https://app.cochat.ai/papers/10.1109/icde.1999.754967
- The paper
- Guha, S., Rastogi, R., & Shim, K. (1999). ROCK: a robust clustering algorithm for categorical attributes. Proceedings 15th International Conference on Data Engineering (Cat. No.99CB36337). https://doi.org/10.1109/icde.1999.754967
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.