Abstract
K-means algorithm is a kind of algorithm with higher frequency at present, but with the continuous research, this algorithm gradually exposes some defects in practical application, which is manifested in the choice of random and sensitive noise points, which is difficult. Get accurate and reliable clustering solutions. Aiming at this kind of defect, a K-means algorithm based on the distance density of noise points is proposed. Specifically, it uses the effect of density and distance on the cluster center to perform weighted analysis and prediction of the randomness of its data. Processing, based on the determination of data weights, further introduce the “minimum and maximum principle”, which can automatically select the initial clustering center and determine the number of clustering centers. The research results show that this new algorithm can meet the expected requirements, which can not only ensure the accuracy and reliability of the optimization results from the source, but also help people to conduct a more comprehensive and rigorous analysis of the data.
Keywords
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Shunye, W.: An improved k-means clustering algorithm based on dissimilarity. In: Proceedings 2013 International Conference on IEEE Mechatronic Sciences, Electric Engineering and Computer (MEC), pp. 2629–2633 (2013)
Xu, J., Xu, B., Zhang, W.: Stable initialization scheme for k-means clustering. Wuhan Univ. J. Nat. Sci. 14(1), 24–28 (2009)
Redmond, S.J., Heneghan, C.: A method for initializing the K-means clustering algorithm using kd-trees. Pattern Recogn. Lett. 28(8), 965–973 (2007)
Zhao, B., Wang, J., Li, M., et al.: Prediction of essential proteins based on overlapping essential modules. IEEE Trans. Nanobiosci. 13(4), 415–424 (2014)
Likas, A., Vlassis, M., Verbeek, J.: The global K-means clustering algorithm. Pattern Recogn. 36(2), 451–461 (2003)
Na, S., Xumin, L., Yong, G.: Research on k-means clustering algorithm: an improved k-means clustering algorithm. In: 2010 Third International Symposium on IEEE Intelligent Information Technology and Security Informatics (IITSI), pp. 63–67 (2010)
Kastrati, Z., Imran, A.S.: Performance analysis of machine learning classifiers on improved concept vector space models. Future Gener. Comput. Syst. 96, 552–562 (2019)
Kim, S.-W., Gil, J.-M.: Research paper classification systems based on TF-IDF and LDA schemes. Hum. Centric Comput. Inf. Sci. 9(1), 30 (2019)
Huang, S., Hu, P.: K-means clustering efficient algorithm with initial class center selection. In: Proceedings of the 2018 3rd International Workshop on Materials Engineering and Computer Sciences (IWMECS 2018) (2018)
Chen, X., Min, Y., Zhao, Y., et al.: GMDBSCAN: multi-density DBSCAN cluster based on grid. In: IEEE International Conference on e-Business Engineering (2008)
Suyu, H., Hu, P.: K-means clustering efficient algorithm with initial class center selection. In: Proceedings of the 2018 3rd International Workshop on Materials Engineering and Computer Sciences (IWMECS 2018) (2018)
Wang, Y., Mei, R.: Research on the improved initial clustering center selection algorithm. Int. J. Digit. Content Technol. Appl. 7(4), 130 (2013)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2020 Springer Nature Switzerland AG
About this paper
Cite this paper
Li, X., Tan, H. (2020). K-Means Algorithm Based on Initial Cluster Center Optimization. In: Xu, Z., Parizi, R., Hammoudeh, M., Loyola-González, O. (eds) Cyber Security Intelligence and Analytics. CSIA 2020. Advances in Intelligent Systems and Computing, vol 1146. Springer, Cham. https://doi.org/10.1007/978-3-030-43306-2_44
Download citation
DOI: https://doi.org/10.1007/978-3-030-43306-2_44
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-43305-5
Online ISBN: 978-3-030-43306-2
eBook Packages: Intelligent Technologies and RoboticsIntelligent Technologies and Robotics (R0)