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

Institutions

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

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Multivariate Time Series Clustering Algorithm Based on Improved K-Nearest Neighbor Network

Hongsheng Bi, Yanqing Ye, Xiaomin Zhu, Pengfei Yang et al.
Advanced Algorithms and Applications
article

Multivariate Time Series Clustering Algorithm Based on Improved K-Nearest Neighbor Network

Hongsheng Bi, Yanqing Ye, Xiaomin Zhu, Pengfei Yang, Bo Xiao, Weilong Yang
article en

Abstract

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.

Academy of Military Medical Sciences (CN), PLA Academy of Military Science (CN)
National Natural Science Foundation of China
Openalex Percentile: Top 79%
Advanced Algorithms and Applications
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Multivariate Time Series Clustering Algorithm Based on Improved K-Nearest Neighbor Network — Hongsheng Bi, Yanqing Ye, et al. · (2025) | TGRS Research Map | TGRS