A new shape-based clustering algorithm for time series

2022 
Time series clustering is a research hotspot in data mining. Most of the existing clustering algorithms combine with the classical distance measure which ignore the offset of sequence shape. As a result, shape-based clustering algorithms are becoming increasingly popular. On the majority of data sets, the most representative shape-based clustering algorithm, KShape, which defines a shape-based distance with shift invariance, has been shown to outperform other algorithms.In this paper, we propose a new shape-based clustering algorithm named Fractional Order Shape-based k-cluster(FrOKShape), which defines a multi-variable shape-based distance by normalized fractional order cross-correlation and uses the DTW Barycenter Averaging (DBA) as a center computation strategy. Our distance exhibits excellent shape shift deviating properties and good compatibility integrated with a variety of existing clustering center strategies so that it can provide more potential good results. Experiments show that combining our distance with a traditional clustering algorithm produces excellent clustering indicators. In a series of comparative experiments, FrOKShape also exhibits a comparable result to the existing better shape-based clustering algorithm KShape.
    • Correction
    • Source
    • Cite
    • Save
    • Machine Reading By IdeaReader
    0
    References
    0
    Citations
    NaN
    KQI
    []