The DOI matches its Crossref record; 8 of the 8 references it cites were found in a registry or an index.
Research on K-Value Selection Method of K-Means Clustering Algorithm
Open accessAbstract
Among many clustering algorithms, the K-means clustering algorithm is widely used because of its simple algorithm and fast convergence. However, the K-value of clustering needs to be given in advance and the choice of K-value directly affect the convergence result. To solve this problem, we mainly analyze four K-value selection algorithms, namely Elbow Method, Gap Statistic, Silhouette Coefficient, and Canopy; give the pseudo code of the algorithm; and use the standard data set Iris for experimental verification. Finally, the verification results are evaluated, the advantages and disadvantages of the above four algorithms in a K-value selection are given, and the clustering range of the data set is pointed out.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
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
Estimating the Number of Clusters in a Data Set Via the Gap Statistic
Tibshirani, R., Walther, G., & Hastie, T. (2001) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/1467-9868.00293 · Cited by 6,205
An efficient k-means clustering algorithm: analysis and implementation
Kanungo, T., Mount, D. M., Netanyahu, N. S., Piatko, C. D., Silverman, R., & Wu, A. Y. (2002) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2002.1017616 · Cited by 5,660 · cited 6×
“Two algorithms which extend the k-means algorithm to categorical domains and domains are reported in Reference [6], through the pattern mixing algorithm, the combination of the e ff ectiveness measure, in order to solve the problem of complex data and more noise in the real world.”
MethodInfluentialExtensions 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
Constrained K-means Clustering with Background Knowledge
Wagstaff, K. L., Cardie, C., Rogers, S., & Schrödl, S. (2001) · Cited by 2,469
Efficient clustering of high-dimensional data sets with application to reference matching
McCallum, A., Nigam, K., & Ungar, L. H. (2000) · Proceedings of the sixth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/347090.347123 · Cited by 1,096
Esteves, R. M., & Rong, C. (2011) · IEEE International Conference on Cloud Computing Technology and Science · doi:10.1109/cloudcom.2011.86 · Cited by 72
Rathod, R. R., & Garg, R. D. (2017) · International Journal of Energy Sector Management · doi:10.1108/ijesm-02-2016-0005 · Cited by 17
Cited by
Shi, C., Wei, B., Wei, S., Wang, W., Liu, H., & Liu, J. (2021) · EURASIP Journal on Wireless Communications and Networking · doi:10.1186/s13638-021-01910-w · Cited by 441
Machine Learning and Deep Learning in smart manufacturing: The Smart Grid paradigm
Kotsiopoulos, T., Sarigiannidis, P., Ioannidis, D., & Tzovaras, D. (2021) · Computer Science Review · doi:10.1016/j.cosrev.2020.100341 · Cited by 341
Ji, I. H., Lee, J. H., Kang, M. J., Park, W. J., Jeon, S. H., & Seo, J. T. (2024) · Sensors · doi:10.3390/s24030898 · Cited by 74
Uncovering Prognosis-Related Genes and Pathways by Multi-Omics Analysis in Lung Cancer
Asada, K., Kobayashi, K., Joutard, S., Tubaki, M., Takahashi, S., Takasawa, K., Komatsu, M., Kaneko, S., Sese, J., & Hamamoto, R. (2020) · Biomolecules · doi:10.3390/biom10040524 · Cited by 67
Data-Driven Mathematical Model of Osteosarcoma
Le, T., Su, S., Kirshtein, A., & Shahriyari, L. (2021) · Cancers · doi:10.3390/cancers13102367 · Cited by 39
Metadata
- Authors
- Yuan, C., & Yang, H.
- Venue
- J
- Publisher
- MDPI AG
- Published
- 2019-06-18
- Volume
- 2
- Issue
- 2
- Pages
- 226-235
- ISSN
- 2571-8800 (ISSN-L)
- OpenAlex
- W2949488362
- Cited by
- 846
- References
- 8
- FWCI
- 43.28
- Type
- journal article
- Language
- en
- Open access
- gold
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.