The DOI matches its Crossref record; 28 of the 28 references it cites were found in a registry or an index.
Extensions to the k-Means Algorithm for Clustering Large Data Sets with Categorical Values
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
(1967) · Cited by 23,719
(1992) · Cited by 23,431
(1996) · Cited by 20,179
Finding groups in data: an introduction to cluster analysis
(1991) · Choice Reviews Online · doi:10.5860/choice.28-4558 · Cited by 10,474
Pattern Recognition with Fuzzy Objective Function Algorithms
Bezdek, J. C. (1981) · doi:10.1007/978-1-4757-0450-1 · Cited by 9,881
Everitt, B. J., Landau, S., & Leese, M. (1974) · Cited by 9,355
Algorithms for Clustering Data
Sarle, W. S. (1990) · Technometrics · doi:10.1080/00401706.1990.10484648 · Cited by 7,865
Finding Groups in Data: An Introduction to Cluster Analysis
Kaufman, L., & Rousseeuw, P. J. (1990) · Wiley Series in Probability and Statistics · doi:10.1002/9780470316801 · Cited by 7,344
A General Coefficient of Similarity and Some of Its Properties
Gower, J. C. (1971) · Biometrics · doi:10.2307/2528823 · Cited by 5,303
Cluster Analysis for Applications
(1973) · Elsevier eBooks · doi:10.1016/c2013-0-06161-0 · Cited by 5,080
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
An Examination of Procedures for Determining the Number of Clusters in a Data Set
Milligan, G. W., & Cooper, M. C. (1985) · Psychometrika · doi:10.1007/bf02294245 · Cited by 3,868
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
Knowledge acquisition via incremental conceptual clustering
Fisher, D. H. (1987) · Machine Learning · doi:10.1007/bf00114265 · Cited by 1,991
Efficient and Effective Clustering Methods for Spatial Data Mining
Ng, R. T., & Han, J. (1994) · Cited by 1,778
K-Means-Type Algorithms: A Generalized Convergence Theorem and Characterization of Local Optimality
Selim, S. Z., & Ismail, M. A. (1984) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.1984.4767478 · Cited by 1,212
A clustering technique for summarizing multivariate data
Ball, G. H., & Hall, D. J. (1967) · Behavioral Science · doi:10.1002/bs.3830120210 · Cited by 912
Cormack, R. M. (1971) · Journal of the Royal Statistical Society. Series A (General) · doi:10.2307/2344237 · Cited by 803
A Fast Clustering Algorithm to Cluster Very Large Categorical Data Sets in Data Mining.
Huang, J. Z. (1997) · Cited by 551
A Monte Carlo Study of Thirty Internal Criterion Measures for Cluster Analysis
Milligan, G. W. (1981) · Psychometrika · doi:10.1007/bf02293899 · Cited by 407
Clustering large data sets with mixed numeric and categorical values
Huang, J. Z. (1997) · Cited by 341
Automated Construction of Classifications: Conceptual Clustering Versus Numerical Taxonomy
Michalski, R. S., & Stepp, R. E. (1983) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.1983.4767409 · Cited by 320
Experiments with incremental concept formation: UNIMEM
Lebowitz, M. (1987) · Machine Learning · doi:10.1007/bf00114264 · Cited by 303
Validity studies in clustering methodologies
Dubes, R., & Jain, A. K. (1979) · Pattern Recognition · doi:10.1016/0031-3203(79)90034-7 · Cited by 296
A conceptual version of the K-means algorithm
Ralambondrainy, H. (1995) · Pattern Recognition Letters · doi:10.1016/0167-8655(95)00075-r · Cited by 271
How many clusters are best? - An experiment
Dubes, R. C. (1987) · Pattern Recognition · doi:10.1016/0031-3203(87)90034-3 · Cited by 226
The validation of four ultrametric clustering algorithms
Milligan, G. W., & Isaac, P. D. (1980) · Pattern Recognition · doi:10.1016/0031-3203(80)90001-1 · Cited by 94
Knowledge discovery in databases terminology
Klösgen, W., & Żytkow, J. M. (1996) · Publikationsdatenbank der Fraunhofer-Gesellschaft (Fraunhofer-Gesellschaft) · Cited by 44
Cited by
Data mining: concepts and techniques
(2012) · Choice Reviews Online · doi:10.5860/choice.49-3305 · Cited by 28,531
Survey of Clustering Algorithms
Xu, R., & WunschII, D. (2005) · IEEE Transactions on Neural Networks · doi:10.1109/tnn.2005.845141 · Cited by 6,197
A Survey of Clustering Data Mining Techniques
Berkhin, P. (2006) · Grouping Multidimensional Data · doi:10.1007/3-540-28349-8_2 · Cited by 2,804
Ikotun, A. M., Ezugwu, A. E., Abualigah, L., Abuhaija, B., & Heming, J. (2023) · Information Sciences · doi:10.1016/j.ins.2022.11.139 · Cited by 2,272
The k-means Algorithm: A Comprehensive Survey and Performance Evaluation
Ahmed, M., Seraj, R., & Islam, S. M. S. (2020) · Electronics · doi:10.3390/electronics9081295 · Cited by 1,717
Metadata
- Authors
- Huang, Z.
- Venue
- Data Mining and Knowledge Discovery
- Published
- 1998-09
- Volume
- 2
- Issue
- 3
- Pages
- 283-304
- ISSN
- 1384-5810 (ISSN-L)
- 1573-756X
- OpenAlex
- W2149230623
- Cited by
- 2,505
- References
- 28
- FWCI
- 9.19
- 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.