Multidimensional time series motif group discovery based on matrix profile

被引:1
|
作者
Cao, Danyang [1 ]
Lin, Zifeng [1 ]
机构
[1] North China Univ Technol, Coll Informat Sci & Technol, 5 Jin Yuan Zhuang Rd, Beijing 100144, Peoples R China
关键词
Multidimensional time series; Matrix profile; Motif discovery;
D O I
10.1016/j.knosys.2024.112509
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
With the continuous advancements in sensor technology and the increasing capabilities for data collection and storage, the acquisition of time series data across diverse domains has become significantly easier. Consequently, there is a growing demand for identifying potential motifs within multidimensional time series. The introduction of the Matrix Profile (MP) structure and the mSTOMP algorithm enables the detection of multidimensional motifs in large-scale time series datasets. However, the Matrix Profile (MP) does not provide information regarding the frequency of occurrence of these motifs. As a result, it is challenging to determine whether a motif appears frequently or to identify the specific time periods during which it typically occurs, thereby limiting further analysis of the discovered motifs. To address this limitation, we proposed Index Link Motif Group Discovery (ILMGD) algorithm, which uses index linking to rapidly merge and group multidimensional motifs. Based on the results of the ILMGD algorithm, we can determine the frequency and temporal positions of motifs, facilitating deeper analysis. Our proposed method requires minimal additional parameters and reduces the need for extensive manual intervention. We validate the effectiveness of our algorithm on synthetic datasets and demonstrate its applicability on three real-world datasets, highlighting how it enables a comprehensive understanding of the discovered motifs.
引用
收藏
页数:18
相关论文
共 50 条
  • [1] Time Series Motif Discovery Using Approximated Matrix Profile
    Pariwatthanasak, Korakot
    Ratanamahatana, Chotirat Ann
    THIRD INTERNATIONAL CONGRESS ON INFORMATION AND COMMUNICATION TECHNOLOGY, 2019, 797 : 707 - 716
  • [2] Matrix Profile VI: Meaningful Multidimensional Motif Discovery
    Yeh, Chin-Chia Michael
    Kavantzas, Nickolas
    Keogh, Eamonn
    2017 17TH IEEE INTERNATIONAL CONFERENCE ON DATA MINING (ICDM), 2017, : 565 - 574
  • [3] An Enhanced Time Series Motif Discovery Using Approximated Matrix Profile
    Onwongsa, Chanapon
    Ratanamahatana, Chotirat Ann
    PROCEEDINGS OF 2020 2ND INTERNATIONAL CONFERENCE ON IMAGE PROCESSING AND MACHINE VISION AND INTERNATIONAL CONFERENCE ON PATTERN RECOGNITION AND MACHINE LEARNING, IPMV 2020, 2020, : 180 - 189
  • [4] Matrix Profile IX: Admissible Time Series Motif Discovery With Missing Data
    Zhu, Yan
    Mueen, Abdullah
    Keogh, Eamonn
    IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2021, 33 (06) : 2616 - 2626
  • [5] Matrix Profile XI: SCRIMP plus plus : Time Series Motif Discovery at Interactive Speeds
    Zhu, Yan
    Yeh, Chin-Chia Michael
    Zimmerman, Zachary
    Kamgar, Kaveh
    Keogh, Eamonn
    2018 IEEE INTERNATIONAL CONFERENCE ON DATA MINING (ICDM), 2018, : 837 - 846
  • [6] Persistence-Based Motif Discovery in Time Series
    Germain, Thibaut
    Truong, Charles
    Oudre, Laurent
    IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2024, 36 (11) : 6814 - 6827
  • [7] Side-Length-Independent Motif (SLIM): Motif Discovery and Volatility Analysis in Time Series-SAX, MDL and the Matrix Profile
    Cartwright, Eoin
    Crane, Martin
    Ruskin, Heather J.
    FORECASTING, 2022, 4 (01): : 219 - 237
  • [8] kNN matrix profile for knowledge discovery from time series
    Mondal, Tanmoy
    Akbarinia, Reza
    Masseglia, Florent
    DATA MINING AND KNOWLEDGE DISCOVERY, 2023, 37 (03) : 1055 - 1089
  • [9] kNN matrix profile for knowledge discovery from time series
    Tanmoy Mondal
    Reza Akbarinia
    Florent Masseglia
    Data Mining and Knowledge Discovery, 2023, 37 : 1055 - 1089
  • [10] Constrained Motif Discovery in Time Series
    Yasser Mohammad
    Toyoaki Nishida
    New Generation Computing, 2009, 27 : 319 - 346