Rare Time Series Motif Discovery from Unbounded Streams

Summary: Targets approximately repeated subsequences that are vanishingly rare in unbounded time-series streams. Proves exact motif discovery is impossible under reasonable assumptions, then provides high-probability algorithms for the underlying problem. (summarized by gpt-5.6-luna on Jul 24 2026)

Paper ID: 11214
Venue: VLDB
Year: 2015
Pagerank: 6.2641987e-05
Overall Rank: 5,325 | 63.47%
DOI: 10.14778/2735479.2735484

Incoming Non-self Citations Over Time

Authors

1. Nurjahan Begum (University of California Riverside)
2. Eamonn Keogh (University of California Riverside)

BibTeX Citation

@article{begum_vldb15,
        title = {{Rare Time Series Motif Discovery from Unbounded Streams}},
        author = {Begum, Nurjahan and Keogh, Eamonn},
        journal = {PVLDB},
        series = {{VLDB} '15},
        volume = {8},
        number = {2},
        pages = {149--160},
        doi = {10.14778/2735479.2735484},
        url = {https://doi.org/10.14778/2735479.2735484},
        year = {2015}
}

Incoming Citations (Sorted by Pagerank)

Showing 6 of 6 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank
4,604	Debunking Four Long-Standing Misconceptions of Time-Series Distance Measures	2020	SIGMOD	6.6104585e-05
5,335	Clustering Stream Data by Exploring the Evolution of Density Mountain	2018	VLDB	6.2618226e-05
10,747	A Structured Study of Multivariate Time-Series Distance Measures	2025	SIGMOD	5.093636e-05
10,978	Time-Series Clustering: A Comprehensive Study of Data Mining, Machine Learning, and Deep Learning Methods	2025	VLDB	5.093636e-05
11,435	Accelerating Similarity Search for Elastic Measures: A Study and New Generalization of Lower Bounding Distances	2023	VLDB	5.093636e-05
11,932	Vocalizing Large Time Series Efficiently	2018	VLDB	5.093636e-05

Outgoing Citations (Sorted by Pagerank)

Showing 0 of 0 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Rank	Cited Paper	Year	Venue	Pagerank

Semantically Similar Papers

#	Overall Rank	Paper	Year	Venue
1	5,043	Efficient Temporal Pattern Mining in Big Time Series Using Mutual Information	2022	VLDB
2	8,542	Online Windowed Subsequence Matching over Probabilistic Sequences	2012	SIGMOD
3	6,230	Mining Periodic Patterns with Gap Requirement from Sequences	2005	SIGMOD
4	4,236	On Dense Pattern Mining in Graph Streams	2010	VLDB
5	7,691	Finding Relevant Patterns in Bursty Sequences	2008	VLDB
6	885	Finding Frequent Items in Data Streams	2008	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	5,266	Fast and Scalable Mining of Time Series Motifs with Probabilistic Guarantees	2022	VLDB
10	10,859	Time Series Motif Discovery: A Comprehensive Evaluation	2025	VLDB