Finding Relevant Patterns in Bursty Sequences

Summary: Novel transformation of bursty sequences reduces irrelevant repetitive patterns and mining cost. Transformed data remain compatible with existing mining algorithms; at fixed support, results are faster, smaller, and faithful to the original patterns. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID: 9660
Venue: VLDB
Year: 2008
Pagerank: 4.7859835e-05
Overall Rank: 7,243 | 49.67%
DOI: -

Incoming Non-self Citations Over Time

Authors

1. Alexander Lachmann
2. Mirek Riedewald

Incoming Citations (Sorted by Pagerank)

Showing 1 of 1 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank
4,713	Mining Graph Patterns Efficiently via Randomized Summaries	2009	VLDB	5.9694403e-05

Outgoing Citations (Sorted by Pagerank)

Showing 1 of 1 cited papers.

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

Rank	Cited Paper	Year	Venue	Pagerank
36	Fast Algorithms for Mining Association Rules	1994	VLDB	0.00076114894

Semantically Similar Papers

Overall Rank	Paper	Year	Venue	Pagerank
2,117	On the Spatiotemporal Burstiness of Terms	2012	VLDB	9.5088574e-05
831	Finding Frequent Items in Data Streams	2008	VLDB	0.00016094846
829	Efficiently Mining Long Patterns from Databases	1998	SIGMOD	0.00016137512
4,951	Efficient Temporal Pattern Mining in Big Time Series Using Mutual Information	2022	VLDB	5.8067758e-05
12,654	Mining Long Sequential Patterns in a Noisy Environment	2002	SIGMOD	4.1905499e-05
5,773	Mining Frequent Patterns with Differential Privacy	2013	VLDB	5.3300095e-05
5,675	Rare Time Series Motif Discovery from Unbounded Streams	2015	VLDB	5.3774215e-05
2,478	Identifying Similarities, Periodicities and Bursts for Online Search Queries	2004	SIGMOD	8.6866662e-05
4,300	Mining Periodic Patterns with Gap Requirement from Sequences	2005	SIGMOD	6.2824978e-05
8,122	Efficient Discovery of Sequence Outlier Patterns	2019	VLDB	4.5771031e-05