Time series motif discovery: dimensions and applications

被引:43
|
作者
Mueen, Abdullah [1 ]
机构
[1] Univ New Mexico, Dept Comp Sci, Albuquerque, NM 87131 USA
关键词
D O I
10.1002/widm.1119
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Time series motifs are repeated segments in a long time series that, if exist, carry precise information about the underlying source of the time series. Motif discovery in time series data has received significant attention in the data mining community since its inception, principally because, motif discovery is meaningful and more likely to succeed when the data is large. Algorithms for motif discovery generally deal with three aspects the definition of the motifs, domain based preprocessing, and finally, the algorithmic steps. Typical definitions of motifs signify the similarity or the support of the motifs. Domains impose preprocessing requirements to meaningful motif finding such as data alignment, interpolation, and transformation. Motif discovery algorithms vary based on exact or approximate evaluation of the definition. In addition, algorithms require different representations [Symbolic Aggregate approXimation (SAX), DFT etc.] and similarity measures [correlation, dynamic time warping (DTW) distance etc.] for time series segments. In this paper, we discuss these three facets in detail with examples taken from the literature. We briefly describe a set of applications of time series motif in various domains and elaborate on a certain application in entomology to analyze insect behavior. Conflict of interest: The author has declared no conflicts of interest for this article. For further resources related to this article, please visit the .
引用
收藏
页码:152 / 159
页数:8
相关论文
共 50 条
  • [1] Constrained Motif Discovery in Time Series
    Yasser Mohammad
    Toyoaki Nishida
    [J]. New Generation Computing, 2009, 27 : 319 - 346
  • [2] Survey on time series motif discovery
    Torkamani, Sahar
    Lohweg, Volker
    [J]. WILEY INTERDISCIPLINARY REVIEWS-DATA MINING AND KNOWLEDGE DISCOVERY, 2017, 7 (02)
  • [3] Constrained Motif Discovery in Time Series
    Mohammad, Yasser
    Nishida, Toyoaki
    [J]. NEW GENERATION COMPUTING, 2009, 27 (04) : 319 - 346
  • [4] Genetic time series motif discovery for time series classification
    Ramanujam, E.
    Padmavathi, S.
    [J]. INTERNATIONAL JOURNAL OF BIOMEDICAL ENGINEERING AND TECHNOLOGY, 2019, 31 (01) : 47 - 63
  • [5] Parallel Exact Time Series Motif Discovery
    Narang, Ankur
    Bhattacherjee, Souvik
    [J]. EURO-PAR 2010 - PARALLEL PROCESSING, PART II, 2010, 6272 : 304 - 315
  • [6] Variable Length Motif Discovery in Time Series Data
    Van Onsem, M.
    Ledoux, V.
    Melange, W.
    Dreesen, D.
    Van Hoecke, S.
    [J]. IEEE ACCESS, 2023, 11 : 73754 - 73766
  • [7] Motif Discovery in Long Time Series: Classifying Phonocardiograms
    Alhijailan, Hajar
    Coenen, Frans
    [J]. ARTIFICIAL INTELLIGENCE XXXVI, 2019, 11927 : 198 - 212
  • [8] Efficient Proper Length Time Series Motif Discovery
    Yingchareonthawornchai, Sorrachai
    Sivaraks, Haemwaan
    Rakthanmanon, Thanawin
    Ratanamahatana, Chotirat Ann
    [J]. 2013 IEEE 13TH INTERNATIONAL CONFERENCE ON DATA MINING (ICDM), 2013, : 1265 - 1270
  • [9] Particle swarm optimization for time series motif discovery
    Serra, Joan
    Lluis Arcos, Josep
    [J]. KNOWLEDGE-BASED SYSTEMS, 2016, 92 : 127 - 137
  • [10] A disk-aware algorithm for time series motif discovery
    Mueen, Abdullah
    Keogh, Eamonn
    Zhu, Qiang
    Cash, Sydney S.
    Westover, M. Brandon
    Bigdely-Shamlo, Nima
    [J]. DATA MINING AND KNOWLEDGE DISCOVERY, 2011, 22 (1-2) : 73 - 105