Abstract

When data mining research is conducted, it is difficult to obtain precise domain knowledge to set a similarity threshold. Furthermore, noise and missing values are inevitable. Missing values and noise without pre-processing are challenges for many algorithms. A time-series clustering method is proposed based on the normal cloud model and complex networks. Matrix profile similarity measurement, normal cloud model generation and filtering, cloud model expectation curve weighting, degree centrality reweighting, and community discovery in complex networks are the five stages of the proposed clustering algorithm. Local features are considered, and the effects of missing values are reduced when performing similarity measurements. The normal cloud model can be used to set thresholds adaptively. The Louvain algorithm accomplishes the clustering task in complex networks without specifying the clusters. Experiments are conducted on 94 datasets and are compared with 8 clustering methods in the UCR time-series clustering benchmark study. Experimental results indicate that the proposed method can perform well on many datasets.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call