Dynamic Matrix Clustering Method Based on Time Series
Lu Liu · Journal of Smart Technology Applications · 2021
Time series event clustering is the basis of research event classification and mining analysis.Existing clustering methods mostly directly cluster continuous events with time attributes and complex structures, without considering the conversion of clustering objects, and the accuracy of clustering results is low, and the efficiency is poor.To solve these problems, a dynamic matrix clustering method for time series events is proposed.Construct an event neighbor evaluation system, and construct a candidate set through the backward difference calculation strategy of neighbor scores.This paper proposes a method for selecting candidate sets of diverse sequences based on combinatorial optimization, and quickly obtains the optimal solution of the diverse sequence RDS from the candidate sets.Finally, the distance matrix between RDS and the data set is dynamically constructed, and a matrix clustering method based on K-means is proposed to realize the effective division of the categories of time series events.