An Improved K-Means Algorithm Based on Contour Similarity

Jing Zhao (), Yanke Bao, Dongsheng Li and Xinguo Guan
Additional contact information
Jing Zhao: Key Laboratory of Industrial Automation and Machine Vision of Qiannan, School of Mathematics and Statistics, Qiannan Normal University for Nationalities, Duyun 558000, China
Yanke Bao: College of Science, Liaoning Technical University, Fuxin 123000, China
Dongsheng Li: Key Laboratory of Industrial Automation and Machine Vision of Qiannan, School of Mathematics and Statistics, Qiannan Normal University for Nationalities, Duyun 558000, China
Xinguo Guan: Key Laboratory of Industrial Automation and Machine Vision of Qiannan, School of Mathematics and Statistics, Qiannan Normal University for Nationalities, Duyun 558000, China

Mathematics, 2024, vol. 12, issue 14, 1-16

Abstract: The traditional k-means algorithm is widely used in large-scale data clustering because of its easy implementation and efficient process, but it also suffers from the disadvantages of local optimality and poor robustness. In this study, a Csk-means algorithm based on contour similarity is proposed to overcome the drawbacks of the traditional k-means algorithm. For the traditional k-means algorithm, which results in local optimality due to the influence of outliers or noisy data and random selection of the initial clustering centers, the Csk-means algorithm overcomes both drawbacks by combining data lattice transformation and dissimilar interpolation. In particular, the Csk-means algorithm employs Fisher optimal partitioning of the similarity vectors between samples for the process of determining the number of clusters. To improve the robustness of the k-means algorithm to the shape of the clusters, the Csk-means algorithm utilizes contour similarity to compute the similarity between samples during the clustering process. Experimental results show that the Csk-means algorithm provides better clustering results than the traditional k-means algorithm and other comparative algorithms.

Keywords: k-means algorithm; degree of similarity; contour similarity; improved algorithm (search for similar items in EconPapers)
JEL-codes: C (search for similar items in EconPapers)
Date: 2024
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
https://www.mdpi.com/2227-7390/12/14/2211/pdf (application/pdf)
https://www.mdpi.com/2227-7390/12/14/2211/ (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:gam:jmathe:v:12:y:2024:i:14:p:2211-:d:1435520

Access Statistics for this article

Mathematics is currently edited by Ms. Emma He

More articles in Mathematics from MDPI
Bibliographic data for series maintained by MDPI Indexing Manager ().