False Positive or False Negative: Mining Frequent Itemsets from High Speed Transactional Data Streams
Summary: Mining frequent itemsets from high-speed transactional streams under strict memory bounds; exponential itemset space (2^I-1) makes tracking hard. False-negative oriented algorithms with Chernoff-bound guarantees trade misses for bounded memory, achieving controllable recall and outperforming prior false-positive methods in accuracy, memory, and CPU time. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Jeffrey Xu Yu
- 2. Zhihong Chong
- 3. Hongjun Lu
- 4. Aoying Zhou
Incoming Citations (Sorted by Pagerank)
Showing 3 of 3 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 1,584 | Augmented Sketch: Faster and More Accurate Stream Processing | 2016 | SIGMOD | 0.00011255801 |
| 4,089 | On Dense Pattern Mining in Graph Streams [Extended Abstract] | 2010 | VLDB | 6.4587806e-05 |
| 12,562 | Using Association Rules for Fraud Detection in Web Advertising Networks | 2005 | VLDB | 4.1945683e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 4 of 4 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.00076161096 |
| 166 | Approximate Frequency Counts over Data Streams | 2002 | VLDB | 0.00039361552 |
| 781 | Spectral Bloom Filters | 2003 | SIGMOD | 0.00016741046 |
| 865 | What’s Hot and What’s Not: Tracking Most Frequent Items Dynamically | 2003 | PODS | 0.00015808172 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 117 | An Effective Hash-Based Algorithm for Mining Association Rules | 1995 | SIGMOD | 0.00045896865 |
| 4,829 | An Efficient Rigorous Approach for Identifying Statistically Significant Frequent Itemsets | 2009 | PODS | 5.8925807e-05 |
| 181 | Mining Frequent Patterns without Candidate Generation | 2000 | SIGMOD | 0.00036992674 |
| 7,633 | Mining Frequent Itemsets over Uncertain Databases | 2012 | VLDB | 4.6914549e-05 |
| 9,064 | Feasible Itemset Distributions in Data Mining: Theory and Application | 2003 | PODS | 4.4039656e-05 |
| 2,685 | On Differentially Private Frequent Itemset Mining | 2013 | VLDB | 8.3070708e-05 |
| 13,796 | Mining Frequent Itemsets with Bit Strings and Trie | 2002 | VLDB | - |
| 166 | Approximate Frequency Counts over Data Streams | 2002 | VLDB | 0.00039361552 |
| 11,978 | Resource-oriented Approximation for Frequent Itemset Mining from Bursty Data Streams | 2014 | SIGMOD | 4.1945683e-05 |
| 835 | Finding Frequent Items in Data Streams | 2008 | VLDB | 0.00016109621 |