Multivariate Time Series Clustering Algorithm Based on Improved K-Nearest Neighbor Network
To address the limitations of existing clustering algorithms for multivariate time series, such as weak spontaneity and poor clustering performance, this paper proposes a multivariate time series clustering algorithm based on an improved K-Nearest Neighbor (KNN) network. By introducing the shape-based weighted dynamic time warping similarity measure, the similarity between multivariate time series objects is calculated. Subsequently, a directed weighted KNN network is constructed, where nodes represent multivariate time series objects, edges denote KNN relationships, and weights correspond to similarity values. Based on this network model, the K-Means algorithm is used to determine the cluster centers, and the Blondel-Guillaume-Lambiotte-Lefebvre hierarchical community detection algorithm is employed to cluster the time series objects. Numerical experiments demonstrate that the proposed method outperforms other related clustering method in terms of accuracy and robustness. Sensitivity analysis of the value of K in KNN clustering further validates the effectiveness of the parameter selection strategy.
Authors
- Hongsheng Bi (ORCID: https://orcid.org/0000-0003-2595-6271)
- Yanqing Ye (ORCID: https://orcid.org/0000-0003-4244-5385)
- Xiaomin Zhu (ORCID: https://orcid.org/0000-0003-1301-7840)
- Pengfei Yang (ORCID: https://orcid.org/0000-0002-0857-2383)
- Bo Xiao (ORCID: https://orcid.org/0000-0001-7459-8197)
- Weilong Yang (ORCID: https://orcid.org/0000-0001-7888-2304)
Institutions
- Academy of Military Medical Sciences (CN)
- PLA Academy of Military Science (CN)
Publication Details
- Published
- 2025-05-23
- DOI
- https://doi.org/10.1109/icaibd64986.2025.11082005
- Primary Topic
- Advanced Algorithms and Applications
- Type
- article
- Field-Weighted Citation Impact
- 0.00
Funders
- National Natural Science Foundation of China