Improved K-Means Clustering Algorithm Based on Dynamic Clustering
AUTHORS
Liguo Zheng,Harbin Normal University, Harbin, Heilongjiang province, China
ABSTRACT
Cluster analysis can not only find potential and valuable structured information in the data set, but also provide pre-processing functions for other data mining algorithms, and then can refine the processing results to improve the accuracy of the algorithm. Therefore, cluster analysis has become one of the hot research topics in the field of data mining. K-means algorithm, as a clustering algorithm based on the partitioning idea, can compare the differences between the data set classes and classes. We can use the K-means algorithm to mine the clustering results and further discover the potentially valuable knowledge in the data set. Help people make more accurate decisions. This paper summarizes and analyzes the traditional K-means algorithm, summarizes the improvement direction of the K-means algorithm, fully considers the dynamic change of information in the K-means clustering process, and reduces the standard setting value for the termination condition of the algorithm to reduce The number of iterations of the algorithm reduces the learning time; the redundant information generated by the dynamic change of information is deleted to reduce the interference in the dynamic clustering process, so that the algorithm achieves a more accurate and efficient clustering effect. Experimental results show that when the amount of data is large, compared with the traditional K-means algorithm, the improved K-means algorithm has a greater improvement in accuracy and execution efficiency.
KEYWORDS
Cluster analysis, K-means, Dynamic clustering, Data mining
REFERENCES
[1] Zhangt maf, “Improved rough k-means clustering algorithm based on weighted distance measure with Gaussian function,” International Journal of Computer Mathematics, vol.94, no.4, pp.663-675, (2017)
[2] Linxd maogj, “Distributed data stream clustering algorithm based on density grid,” Computer Engineering, vol.38, no.16, pp.70-73, (2012)
[3] Li Wu, Zhao Jiaoyan, and Yan Taishan, “Improved K-means clustering algorithm based on the average difference degree to optimize the initial clustering center,” Control and Decision, vol.32, no.4, pp.759-762, (2017)
[4] Zhou Shibing, Xu Zhenyuan, and Tang Xuqing, “Method for determining the optimal clustering number of K-means algorithm,” Journal of Computer Applications, vol.30, no.8, pp.1995-1998, (2010)
[5] Zuo Jin and Chen Zemao, “Anomaly detection algorithm based on improved K-means clustering,” Computer Science, vol.43, no.8, pp.258-261, (2016)
[6] Xu Dachuan, Xu Yicheng, and Zhang Dongmei, “Summary of K-means algorithm initialization methods,” Journal of Operations Research, vol.22, no.2, pp.111-114, (2017)
[7] Jainak, Murtymn, and Flynnpj, “Data clustering: areview,” A cm Computing Surveys, vol.31, no.3, pp.264-323, (1999)
[8] Jain, Du in, Mao J. “Statistical pattern recognition: are view,” IEEET rans action son Pattern Analysis & Machine Intelligence, vol.27, no.11, pp.1502-1502, (2002)