The DOI matches its Crossref record; 17 of the 17 references it cites were found in a registry or an index.
An efficient enhanced k-means clustering algorithm
Abstract
In k -means clustering, we are given a set of n data points in d -dimensional space ℝ d and an integer k and the problem is to determine a set of k points in ℝ d , called centers, so as to minimize the mean squared distance from each data point to its nearest center. In this paper, we present a simple and efficient clustering algorithm based on the k -means algorithm, which we call enhanced k -means algorithm. This algorithm is easy to implement, requiring a simple data structure to keep some information in each iteration to be used in the next iteration. Our experimental results demonstrated that our scheme can improve the computational speed of the k -means algorithm by the magnitude in the total number of distance calculations and the overall time of computation.
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
(1996) · Cited by 20,179
(1973) · CERN Document Server (European Organization for Nuclear Research) · Cited by 12,895
Finding groups in data: an introduction to cluster analysis
(1991) · Choice Reviews Online · doi:10.5860/choice.28-4558 · Cited by 10,474
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
Vector Quantization and Signal Compression
Gersho, A., & Gray, R. M. (1992) · Springer eBooks · doi:10.1007/978-1-4615-3626-0 · Cited by 7,003
Ankerst, M. (1999) · doi:10.1145/304181.304187 · Cited by 3,982
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
Pattern Classification and Scene Analysis.
Clarke, M. R. B., Duda, R. O., & Hart, P. E. (1974) · Journal of the Royal Statistical Society. Series A (General) · doi:10.2307/2344977 · Cited by 3,222
Cited by
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
Research on k-means Clustering Algorithm: An Improved k-means Clustering Algorithm
Na, S., Xumin, L., & Yong, G. (2010) · 2010 Third International Symposium on Intelligent Information Technology and Security Informatics · doi:10.1109/iitsi.2010.74 · Cited by 845
A Fast Adaptive k-means with No Bounds
Xia, S., Peng, D., Meng, D., Zhang, C., Wang, G., Giem, E., Wei, W., & Chen, Z. (2020) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2020.3008694 · Cited by 149
Metadata
- Authors
- Fahim, A. M., Salem, A. M., Torkey, F. A., & Ramadan, M. A.
- Venue
- Journal of Zhejiang University-SCIENCE A
- Publisher
- Zhejiang University Press
- Published
- 2006-10
- Volume
- 7
- Issue
- 10
- Pages
- 1626-1633
- ISSN
- 1009-3095 (ISSN-L)
- 1673-565X
- 1862-1775
- OpenAlex
- W1990130348
- Cited by
- 342
- References
- 17
- FWCI
- 5.36
- 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: An efficient enhanced k-means clustering algorithm. https://app.cochat.ai/papers/10.1631/jzus.2006.a1626
- The paper
- Fahim, A. M., Salem, A. M., Torkey, F. A., & Ramadan, M. A. (2006). An efficient enhanced k-means clustering algorithm. Journal of Zhejiang University-SCIENCE A. https://doi.org/10.1631/jzus.2006.a1626
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.