Motiflets - Simple and Accurate Detection of Motifs in Time Series
Patrick Schäfer, Ulf Leser
摘要
A time series motif intuitively is a short time series that repeats itself approximately the same within a larger time series. Such motifs often represent concealed structures, such as heart beats in an ECG recording, the riff in a pop song, or sleep spindles in EEG sleep data. Motif discovery (MD) is the task of finding such motifs in a given input series. As there are varying definitions of what exactly a motif is, a number of different algorithms exist. As central parameters they all take the length l of the motif and the maximal distance r between the motif's occurrences. In practice, however, especially suitable values for r are very hard to determine upfront, and found motifs show a high variability even for very similar r values. Accordingly, finding an interesting motif with these methods requires extensive trial-and-error.
In this paper, we present a different approach to the MD problem. We define k -Motiflets as the set of exactly k occurrences of a motif of length l , whose maximum pairwise distance is minimal. This turns the MD problem upside-down: The central parameter of our approach is not the distance threshold r , but the desired number of occurrence k of the motif, which we show is considerably more intuitive and easier to set. Based on this definition, we present exact and approximate algorithms for finding k -Motiflets and analyze their complexity. To further ease the use of our method, we describe statistical tools to automatically determine meaningful values for its input parameters. Thus, for the first time, extracting meaningful motif sets without any a-priori knowledge becomes feasible. By evaluation on several real-world data sets and comparison to four state-of-the-art MD algorithms, we show that our proposed algorithm is both quantitatively superior to its competitors, finding larger motif sets at higher similarity, and qualitatively better, leading to clearer and easier to interpret motifs without any need for manual tuning.
问问这篇 Paper
智能体会读完全文。
Lune 把这篇 Paper 索引到了每一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。
引用它的顶会 Paper8
- REBAR: Retrieval-Based Reconstruction for Time-series Contrastive LearningMaxwell A. Xu, Alexander Moreno, Hui Wei, Benjamin M. Marlin 等ICLR 2024 · 被引用 23 次
- Tokenizing Single-Channel EEG with Time-Frequency Motif LearningJathurshan Pradeepkumar, Xihao Piao, Zheng Chen, Jimeng SunICLR 2026 · 被引用 18 次
- Raising the ClaSS of Streaming Time Series SegmentationArik Ermshaus, Patrick Schäfer, Ulf LeserVLDB 2024 · 被引用 8 次
- Discovering Leitmotifs in Multidimensional Time SeriesPatrick Schäfer, Ulf LeserVLDB 2025 · 被引用 4 次
- TELESAFE - Detecting Private/Work Boundary Crossings in Energy Consumption Trails in TeleworkHaoying Zhang, Mariem Brahem, Nicolas Anciaux, Benjamin Nguyen 等VLDB 2025 · 被引用 1 次
相关 Paper
- Time Series Motif Discovery: A Comprehensive EvaluationValerio Guerrini, Thibaut Germain, Charles Truong, Laurent Oudre 等VLDB 2025 · 被引用 2 次
- MOMENTI: Scalable Motif Mining in Multidimensional Time SeriesMatteo Ceccarello, Francesco Pio Monaco, Francesco SilvestriVLDB 2025 · 被引用 1 次
- Efficient Discovery of Time Series Motifs under both Length Differences and WarpingMakoto Imamura, Takaaki NakamuraKDD 2024 · 被引用 4 次
- Parameter-free Spikelet: Discovering Different Length and Warped Time Series Motifs using an Adaptive Time Series RepresentationMakoto Imamura, Takaaki NakamuraKDD 2023 · 被引用 6 次
- Fast and Scalable Mining of Time Series Motifs with Probabilistic GuaranteesMatteo Ceccarello, Johann GamperVLDB 2022 · 被引用 9 次
