K-means Clustering Algorithm and Its Improvement Research

38Citations
Citations of this article
91Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Clustering is a typical unsupervised learning method, and it is also very important in natural language processing. K-means is one of the classical algorithms in clustering. In k-means algorithm, the processing mode of abnormal data and the similarity calculation method will affect the clustering division. Aiming at the defect of K-means, this paper proposes a new similarity calculation method, that is, a similarity calculation method based on weighted and Euclidean distance. Experiments show that the new algorithm is superior to k-means algorithm in efficiency, correctness and stability.

Cite

CITATION STYLE

APA

Zhao, Y., & Zhou, X. (2021). K-means Clustering Algorithm and Its Improvement Research. In Journal of Physics: Conference Series (Vol. 1873). IOP Publishing Ltd. https://doi.org/10.1088/1742-6596/1873/1/012074

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free