Abstract
It is a hotspot problem to quickly extract valuable information and knowledge hidden in the complex, different types, fuzzy and huge amount of space-time trajectory data. In the space-time trajectory data clustering method, according to the existing deficiencies of the classical K-means algorithm, the mathematical distance method and effective iteration method are used to select the initial clustering center to optimize the K-means algorithm, which improves the accuracy and efficiency of the algorithm. Based on MATLAB experimental simulation platform, the comparison experiments between the classical algorithm and the optimized algorithm, the applicability test of the performance test, and the comparison test with the classical algorithm were designed. The experimental results show that the optimized K-means randomly selected initial clustering center is more accurate, which can avoid the drawbacks caused by randomly selected initial clustering center to a certain extent and has better clustering effect on sample data, and at the same time avoid the K-means clustering algorithm falling into the dilemma of local optimal solution in the clustering process.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Song, J.: Research on Improvement of K-means Clustering Algorithm. Anhui University, Hefei (2016)
Chudova, D., Gaffney, S., Mjolsnes, E., et al.: Translation invariant mixture models for curve clustering. In: Proceedings of the 9h ACM SIG KDD Int Conference on Knowledge Discovery and Data Mining, pp. 79–88. ACM, New York (2003)
Alon, J., Sclaroff, S., Kollios, G., et al.: Discovering clusters in motion time-series data. In: Proceedings of the 2003 IEEE Conference on Computer Vision and Pattern Recognition, pp. Los Alamitos. IEEE Computer Society, Los Alamitos (2003)
Nanni, M., Pedreschi, D.: Tim e-focused clustering of trajectories of moving objects. J. Intell. Inf. Syst. 27(3), 267–289 (2006)
Wang, Q., Jiang, Z.: Improved K-Means Initial Clustering Center Selection Algorithm. Guangxi Normal University, Guilin (2010)
Zhang, Y.: Improved K-Means Algorithm Based on Optimizing Initial Cluster Centers. Northeast Normal University, Changchun (2013)
Wang, J., Ma, X., Duan, G.: Improved K-means clustering K-value selection algorithm. Comput. Eng. Appl. 55(08), 27–33 (2019)
Niu, Q., Chen, Y.: Hybrid clustering algorithm based on KNN and MCL. J. Guilin Univ. Technol. 35(01), 181–186 (2015)
Wang, D.: Inertial Navigation Technology Based on Kalman Filtering. North China University of Technology, Changchun (2018)
Feng, Q., Jiaxin, H., Huang, N., Wang, J.: Improved PTAS for the constrained k -means problem. J. Comb. Optim. 37(4), 1091–1110 (2019)
Deng, X., Chaomurilige, W., Guo, J.: A survey of cluster senter initialization algorithms. J. China Acad. Electron. Inf. Technol. 14(04), 354–359+372 (2019)
Li, Y., Shi, H., Jiao, L., et al.: Quantum-inspired evolutionary clustering algorithm based on manifold distance. Acta Electronica Sinica 39(10), 2343–2347 (2011)
Zhang, L., Chen, Y., Ji, Y., et al.: Research on K-means algorithm based on density. Appl. Res. Comput. 28(11), 4071–4073+4085 (2011)
Jiang, T., Yin, X., Ma, R., et al.: Bus load situation awareness based on the k-means clustering and fuzzy neural networks. J. Electric Power Sci. Technol. 35(03), 46–54 (2020)
Zhou, S., Xu, Z., Tang, X.: Method for determining optimal number of clusters in k-means clustering algorithm. J. Comput. Appl. 30(08), 1995–1998 (2010)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2021 Springer Nature Switzerland AG
About this paper
Cite this paper
Lu, Y. et al. (2021). A K-means Clustering Optimization Algorithm for Spatiotemporal Trajectory Data. In: Zu, Q., Tang, Y., Mladenović, V. (eds) Human Centered Computing. HCC 2020. Lecture Notes in Computer Science(), vol 12634. Springer, Cham. https://doi.org/10.1007/978-3-030-70626-5_11
Download citation
DOI: https://doi.org/10.1007/978-3-030-70626-5_11
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-70625-8
Online ISBN: 978-3-030-70626-5
eBook Packages: Computer ScienceComputer Science (R0)