Open AccessResearch on Density-Based K-means Clustering Algorithm
Author(s) -
Shuxin Liu,
Xiangdong Liu
Publication year - 2021
Publication title -
journal of physics. conference series
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.21
H-Index - 85
eISSN - 1742-6596
pISSN - 1742-6588
DOI - 10.1088/1742-6596/2137/1/012071
Subject(s) - dbscan , cluster analysis , algorithm , computer science , outlier , process (computing) , simple (philosophy) , cluster (spacecraft) , canopy clustering algorithm , cure data clustering algorithm , data mining , artificial intelligence , correlation clustering , philosophy , epistemology , programming language , operating system
Cluster analysis is an unsupervised learning process, and its most classic algorithm K-means has the advantages of simple principle and easy implementation. In view of the K-means algorithm’s shortcoming, where is arbitrary processing of clusters k value, initial cluster center and outlier points. This paper discusses the improvement of traditional K-means algorithm and puts forward an improved algorithm with density clustering algorithm. First, it describes the basic principles and process of the K-means algorithm and the DBSCAN algorithm. Then summarizes improvement methods with the three aspects and their advantages and disadvantages, at the same time proposes a new density-based K-means improved algorithm. Finally, it prospects the development direction and trend of the density-based K-means clustering algorithm.