Matrix Profile X: VALMOD - Scalable Discovery of Variable-Length Motifs in Data Series
Summary: VALMOD delivers exact, scalable discovery of variable-length motifs in data series, removing the need to predefine motif length. It speeds up discovery by up to 20x versus state-of-the-art and yields more intuitive motifs, validated on five real datasets across diverse domains. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Michele Linardi (Paris Descartes University)
- 2. Yan Zhu (University of California Riverside)
- 3. Themis Palpanas (Paris Descartes University)
- 4. Eamonn Keogh (University of California Riverside)
BibTeX Citation
@inproceedings{linardi_sigmod18,
title = {{Matrix Profile X: VALMOD - Scalable Discovery of Variable-Length Motifs in Data Series}},
author = {Linardi, Michele and Zhu, Yan and Palpanas, Themis and Keogh, Eamonn},
series = {{SIGMOD} '18},
booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
publisher = {Association for Computing Machinery},
doi = {10.1145/3183713.3183744},
url = {https://dl.acm.org/doi/10.1145/3183713.3183744},
year = {2018}
}
Incoming Citations (Sorted by Pagerank)
Showing 10 of 10 citing papers.
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 6 of 6 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 190 | Locally Adaptive Dimensionality Reduction for Indexing Large Time Series Databases | 2001 | SIGMOD | 0.00026105472 |
| 1,084 | A Data-adaptive and Dynamic Segmentation Index for Whole Matching on Time Series | 2013 | VLDB | 0.00012256753 |
| 2,441 | Optimal Multi-scale Patterns in Time Series Streams | 2006 | SIGMOD | 8.5779023e-05 |
| 4,077 | Similarity-Based Queries | 1995 | PODS | 6.921027e-05 |
| 4,665 | Coconut: A Scalable Bottom-Up Approach for Building Data Series Indexes | 2018 | VLDB | 6.5780693e-05 |
| 5,244 | Top-k Nearest Neighbor Search In Uncertain Data Series | 2015 | VLDB | 6.3018164e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 12,838 | Mining Long Sequential Patterns in a Noisy Environment | 2002 | SIGMOD |
| 2 | 6,952 | Discovering Leitmotifs in Multidimensional Time Series | 2025 | VLDB |
| 3 | 5,043 | Efficient Temporal Pattern Mining in Big Time Series Using Mutual Information | 2022 | VLDB |
| 4 | 886 | Efficiently Mining Long Patterns from Databases | 1998 | SIGMOD |
| 5 | 5,266 | Fast and Scalable Mining of Time Series Motifs with Probabilistic Guarantees | 2022 | VLDB |
| 6 | 5,325 | Rare Time Series Motif Discovery from Unbounded Streams | 2015 | VLDB |
| 7 | 6,784 | Motiflets - Simple and Accurate Detection of Motifs in Time Series | 2023 | VLDB |
| 8 | 10,927 | MOMENTI: Scalable Motif Mining in Multidimensional Time Series | 2025 | VLDB |
| 9 | 10,859 | Time Series Motif Discovery: A Comprehensive Evaluation | 2025 | VLDB |
| 10 | 3,182 | VALMOD: A Suite for Easy and Exact Detection of Variable Length Motifs in Data Series | 2018 | SIGMOD |