The DOI matches its Crossref record; 9 of the 9 references it cites were found in a registry or an index.
Research on k-means Clustering Algorithm: An Improved k-means Clustering Algorithm
Abstract
Clustering analysis method is one of the main analytical methods in data mining, the method of clustering algorithm will influence the clustering results directly. This paper discusses the standard k-means clustering algorithm and analyzes the shortcomings of standard k-means algorithm, such as the k-means clustering algorithm has to calculate the distance between each data object and all cluster centers in each iteration, which makes the efficiency of clustering is not high. This paper proposes an improved k-means algorithm in order to solve this question, requiring a simple data structure to store some information in every iteration, which is to be used in the next interation. The improved method avoids computing the distance of each data object to the cluster centers repeatly, saving the running time. Experimental results show that the improved method can effectively improve the speed of clustering and accuracy, reducing the computational complexity of the k-means.
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) · Proceedings of the 1996 ACM SIGMOD international conference on Management of data - SIGMOD '96 · doi:10.1145/233269.233324 · Cited by 3,935
Extensions to the k-Means Algorithm for Clustering Large Data Sets with Categorical Values
Huang, Z. (1998) · Data Mining and Knowledge Discovery · doi:10.1023/a:1009769707641 · Cited by 2,505
UCI Repository of Machine Learning Databases
Murphy, P. M. (1994) · Medical Entomology and Zoology · Cited by 1,844
ST-DBSCAN: An algorithm for clustering spatial–temporal data
Birant, D., & Kut, A. (2007) · Data & Knowledge Engineering · doi:10.1016/j.datak.2006.01.013 · Cited by 1,430
An efficient approach to clustering in large multimedia databases with noise
Hinneburg, A., & Keim, D. A. (1998) · KOPS (University of Konstanz) · Cited by 1,181
A Fast Clustering Algorithm to Cluster Very Large Categorical Data Sets in Data Mining.
Huang, J. Z. (1997) · Cited by 551
An efficient enhanced k-means clustering algorithm
Fahim, A. M., Salem, A. M., Torkey, F. A., & Ramadan, M. A. (2006) · Journal of Zhejiang University-SCIENCE A · doi:10.1631/jzus.2006.a1626 · Cited by 342
K-nearest-neighbor consistency in data clustering
Ding, C. H. Q., & He, X. (2004) · ACM Symposium on Applied Computing · doi:10.1145/967900.968021 · Cited by 101
Partitional vs Hierarchical Clustering Using a Minimum Grammar Complexity Approach
Fred, A. L. N., & Leitão, J. M. N. (2000) · Lecture notes in computer science · doi:10.1007/3-540-44522-6_20 · Cited by 23
Cited by
MTH-IDS: A Multitiered Hybrid Intrusion Detection System for Internet of Vehicles
Yang, L., Moubayed, A., & Shami, A. (2022) · IEEE Internet of Things Journal · doi:10.1109/jiot.2021.3084796 · Cited by 416
The future of sleep health: a data-driven revolution in sleep science and medicine
Perez-Pozuelo, I., Zhai, B., Palotti, J., Mall, R., Aupetit, M., Garcia-Gomez, J. M., Taheri, S., Guan, Y., & Fernandez-Luque, L. (2020) · npj Digital Medicine · doi:10.1038/s41746-020-0244-4 · Cited by 311
Yang, Z., Yang, H., Tian, T., Deng, D., Hu, M., Ma, J., Gao, D., Zhang, J., Ma, S., Yang, L., et al. (2023) · Ultrasonics · doi:10.1016/j.ultras.2023.107014 · Cited by 302
Innovative Materials Science via Machine Learning
Gao, C., Min, X., Fang, M., Tao, T., Zheng, X., Liu, Y., Wu, X., & Huang, Z. (2022) · Advanced Functional Materials · doi:10.1002/adfm.202108044 · Cited by 198
Stergiou, K., Ntakolia, C., Varytis, P., Koumoulos, E., Karlsson, P., & Moustakidis, S. (2023) · Computational Materials Science · doi:10.1016/j.commatsci.2023.112031 · Cited by 161
Metadata
- Authors
- Na, S., Xumin, L., & Yong, G.
- Venue
- 2010 Third International Symposium on Intelligent Information Technology and Security Informatics
- Publisher
- IEEE
- Published
- 2010-04
- Pages
- 63-67
- OpenAlex
- W2136023023
- Cited by
- 845
- References
- 9
- FWCI
- 11.95
- 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: Research on k-means Clustering Algorithm: An Improved k-means Clustering Algorithm. https://app.cochat.ai/papers/10.1109/iitsi.2010.74
- The paper
- Na, S., Xumin, L., & Yong, G. (2010). Research on k-means Clustering Algorithm: An Improved k-means Clustering Algorithm. 2010 Third International Symposium on Intelligent Information Technology and Security Informatics. https://doi.org/10.1109/iitsi.2010.74
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.