Alert button
Picture for Gao Xuan

Gao Xuan

Alert button

Improvement of K Mean Clustering Algorithm Based on Density

Add code
Bookmark button
Alert button
Oct 09, 2018
Su Chang, Xu Zhenzong, Gao Xuan

Figure 1 for Improvement of K Mean Clustering Algorithm Based on Density
Figure 2 for Improvement of K Mean Clustering Algorithm Based on Density
Figure 3 for Improvement of K Mean Clustering Algorithm Based on Density
Figure 4 for Improvement of K Mean Clustering Algorithm Based on Density

The purpose of this paper is to improve the traditional K-means algorithm. In the traditional K mean clustering algorithm, the initial clustering centers are generated randomly in the data set. It is easy to fall into the local minimum solution when the initial cluster centers are randomly generated. The initial clustering center selected by K-means clustering algorithm which based on density is more representative. The experimental results show that the improved K clustering algorithm can eliminate the dependence on the initial cluster, and the accuracy of clustering is improved.

Viaarxiv icon
Github IconAccess Paper or Ask Questions
Twitter IconFacebook IconLinkedin IconWhatsapp IconMessenger Icon