The DOI matches its Crossref record; 5 of the 5 references it cites were found in a registry or an index.
A Clustering Method Based on K-Means Algorithm
Open accessAbstract
In this paper we combine the largest minimum distance algorithm and the traditional K-Means algorithm to propose an improved K-Means clustering algorithm. This improved algorithm can make up the shortcomings for the traditional K-Means algorithm to determine the initial focal point. The improved K-Means algorithm effectively solved two disadvantages of the traditional algorithm, the first one is greater dependence to choice the initial focal point, and another one is easy to be trapped in local minimum[1], [2].
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
(1973) · CERN Document Server (European Organization for Nuclear Research) · Cited by 12,895
Algorithms for Clustering Data
Sarle, W. S. (1990) · Technometrics · doi:10.1080/00401706.1990.10484648 · Cited by 7,865
Algorithms for clustering data
Flury, B. (1989) · Journal of Statistical Planning and Inference · doi:10.1016/0378-3758(89)90033-5 · Cited by 6,432
Pattern classification and scene analysis
Chien, Y. (1974) · IEEE Transactions on Automatic Control · doi:10.1109/tac.1974.1100577 · Cited by 3,398
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
Cited by
Potato Leaf Diseases Detection Using Deep Learning
Tiwari, D., Ashish, M., Gangwar, N., Sharma, A., Patel, S., & Bhardwaj, S. (2020) · 2020 4th International Conference on Intelligent Computing and Control Systems (ICICCS) · doi:10.1109/iciccs48265.2020.9121067 · Cited by 330
Prediction of Breast Cancer, Comparative Review of Machine Learning Techniques, and Their Analysis
Fatima, N., Liu, L., Hong, S., & Ahmed, H. (2020) · IEEE Access · doi:10.1109/access.2020.3016715 · Cited by 272
Jin, H., Ru, R., Cai, L., Meng, J., Wang, B., Peng, J., & Yang, S. (2025) · Applied Energy · doi:10.1016/j.apenergy.2024.124629 · Cited by 39
Metadata
- Authors
- Li, Y., & Wu, H.
- Venue
- Physics Procedia
- Publisher
- Elsevier BV
- Published
- 2012
- Volume
- 25
- Pages
- 1104-1109
- ISSN
- 1875-3892 (ISSN-L)
- OpenAlex
- W1973785582
- Cited by
- 411
- References
- 5
- FWCI
- 1.27
- Type
- journal article
- Language
- en
- Open access
- diamond
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: A Clustering Method Based on K-Means Algorithm. https://app.cochat.ai/papers/10.1016/j.phpro.2012.03.206
- The paper
- Li, Y., & Wu, H. (2012). A Clustering Method Based on K-Means Algorithm. Physics Procedia. https://doi.org/10.1016/j.phpro.2012.03.206
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.