Database Paper Browser

Back to papers

Resource-oriented Approximation for Frequent Itemset Mining from Bursty Data Streams

Summary: Resource-oriented approximation for frequent itemset mining on bursty data streams; memory bounded to O(k) and per-transaction time O(kL), avoiding exponential blowup. Output error is bounded with possible false negatives only under certain conditions; dynamic stream reduction and experiments show it outperforms prior space-limited FIM-DS methods. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
4904
Venue
SIGMOD
Year
2014
Pagerank
4.1945683e-05
Overall Rank
11,978 | 16.68%
DOI
10.1145/2588555.2612171

Incoming Non-self Citations Over Time

No non-self incoming citations found for this paper in this database.

Authors

Incoming Citations (Sorted by Pagerank)

Showing 0 of 0 citing papers.

Rank Citing Paper Year Venue Pagerank
Previous Page 1 / 1 Next

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
166 Approximate Frequency Counts over Data Streams 2002 VLDB 0.00039361552
Previous Page 1 / 1 Next

Semantically Similar Papers