Ranking and significance of variable-length similarity-based time series motifs

被引:3
|
作者
Serra, Joan [1 ,2 ]
Serra, Isabel [3 ]
Corral, Alvaro [3 ]
Lluis Arcos, Josep [2 ]
机构
[1] Telefon Res, Barcelona, Spain
[2] Artificial Intelligence Res Inst IIIA CSIC, Barcelona, Spain
[3] Ctr Recerca Matemat, Barcelona, Spain
关键词
Time series; Motif ranking; Distance modeling; Beta distribution; CLASSIFICATION;
D O I
10.1016/j.eswa.2016.02.026
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
The detection of very similar patterns in a time series, commonly called motifs, has received continuous and increasing attention from diverse scientific communities. In particular, recent approaches for discovering similar motifs of different lengths have been proposed. In this work, we show that such variable-length similarity-based motifs cannot be directly compared, and hence ranked, by their normalized dissimilarities. Specifically, we find that length-normalized motif dissimilarities still have intrinsic dependencies on the motif length, and that lowest dissimilarities are particularly affected by this dependency. Moreover, we find that such dependencies are generally non-linear and change with the considered data set and dissimilarity measure. Based on these findings, we propose a solution to rank (previously obtained) motifs of different lengths and measure their significance. This solution relies on a compact but accurate model of the dissimilarity space, using a beta distribution with three parameters that depend on the motif length in a non-linear way. We believe the incomparability of variable-length dissimilarities could have an impact beyond the field of time series, and that similar modeling strategies as the one used here could be of help in a more broad context and in diverse application scenarios. (C) 2016 Elsevier Ltd. All rights reserved.
引用
收藏
页码:452 / 460
页数:9
相关论文
共 50 条
  • [31] Beyond Information Distortion: Imaging Variable-Length Time Series Data for Classification
    Lee, Hyeonsu
    Shin, Dongmin
    SENSORS, 2025, 25 (03)
  • [32] SummerTime: Variable-length Time Series Summarization with Application to Physical Activity Analysis
    Amaral K.
    Li Z.
    Ding W.
    Crouter S.
    Chen P.
    ACM Transactions on Computing for Healthcare, 2022, 3 (04):
  • [33] Exact variable-length anomaly detection algorithm for univariate and multivariate time series
    Wang, Xing
    Lin, Jessica
    Patel, Nital
    Braun, Martin
    DATA MINING AND KNOWLEDGE DISCOVERY, 2018, 32 (06) : 1806 - 1844
  • [34] DISCOVERING OPTIMAL VARIABLE-LENGTH TIME SERIES MOTIFS IN LARGE-SCALE WEARABLE RECORDINGS OF HUMAN BIO-BEHAVIORAL SIGNALS
    Feng, Tiantian
    Narayanan, Shrikanth S.
    2019 IEEE INTERNATIONAL CONFERENCE ON ACOUSTICS, SPEECH AND SIGNAL PROCESSING (ICASSP), 2019, : 7615 - 7619
  • [35] Similarity-based ranking and query processing in multimedia databases
    Candan, KS
    Li, WS
    Priya, ML
    DATA & KNOWLEDGE ENGINEERING, 2000, 35 (03) : 259 - 298
  • [36] GAMIV: A Genetic Algorithm for Identifying Variable-length Motifs in Noncoding DNA
    Gagne, David J.
    PROCEEDINGS OF THE FOURTEENTH INTERNATIONAL CONFERENCE ON GENETIC AND EVOLUTIONARY COMPUTATION COMPANION (GECCO'12), 2012, : 554 - 557
  • [37] Ranking approaches for similarity-based web element location☆
    Coppola, Riccardo
    Feldt, Robert
    Nass, Michel
    Alegroth, Emil
    JOURNAL OF SYSTEMS AND SOFTWARE, 2025, 222
  • [38] Semrank: A Semantic Similarity-Based Tweets Ranking Approach
    Singh, Jagrati
    Singh, Anil Kumar
    INTERNATIONAL JOURNAL OF COGNITIVE INFORMATICS AND NATURAL INTELLIGENCE, 2021, 15 (03) : 74 - 96
  • [39] Similarity-based ranking and query processing in multimedia databases
    Selçuk Candan, K.
    Li, Wen-Syan
    Lakshmi Priya, M.
    Data and Knowledge Engineering, 2000, 35 (03): : 259 - 298
  • [40] A Similarity-Based Ranking Method for Hyperspectral Band Selection
    Xu, Buyun
    Li, Xihai
    Hou, Weijun
    Wang, Yiting
    Wei, Yiwei
    IEEE TRANSACTIONS ON GEOSCIENCE AND REMOTE SENSING, 2021, 59 (11): : 9585 - 9599