Mining Compressed Frequent-Pattern Sets
Summary: Addresses explosive growth of frequent-pattern outputs by compressing sets with delta-clusters and selecting a cluster representative. Proposes two greedy algorithms: RPglobal (guaranteed compression bound, higher cost) and RPlocal (faster, looser bounds; faster than FPClose); both reduce closed patterns by almost two orders of magnitude and enable a tunable quality-efficiency trade-off when combined. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Dong Xin
- 2. Jiawei Han
- 3. Xifeng Yan
- 4. Hong Cheng
Incoming Citations (Sorted by Pagerank)
Showing 5 of 5 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 351 | FG-Index: Towards Verification-Free Query Processing on Graph Databases | 2007 | SIGMOD | 0.00026351742 |
| 4,827 | An Efficient Rigorous Approach for Identifying Statistically Significant Frequent Itemsets | 2009 | PODS | 5.8892254e-05 |
| 5,447 | Output Space Sampling for Graph Patterns | 2009 | VLDB | 5.498563e-05 |
| 8,226 | Mining Approximate Top-K Subspace Anomalies in Multi-Dimensional Time-Series Data | 2007 | VLDB | 4.5505782e-05 |
| 12,103 | A Performance Study of Three Disk-based Structures for Indexing and Querying Frequent Itemsets | 2013 | VLDB | 4.1905499e-05 |
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 |
|---|---|---|---|---|
| 13 | Mining Association Rules between Sets of Items in Large Databases | 1993 | SIGMOD | 0.0010863639 |
| 36 | Fast Algorithms for Mining Association Rules | 1994 | VLDB | 0.00076114894 |
| 182 | Mining Frequent Patterns without Candidate Generation | 2000 | SIGMOD | 0.00036955562 |
| 735 | Beyond Market Baskets: Generalizing Association Rules to Correlations | 1997 | SIGMOD | 0.00017417893 |
| 829 | Efficiently Mining Long Patterns from Databases | 1998 | SIGMOD | 0.00016137512 |
| 1,604 | Scalable Techniques for Mining Causal Structures | 1998 | VLDB | 0.00011181856 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 5,158 | Towards Proximity Pattern Mining in Large Graphs | 2010 | SIGMOD | 5.6510256e-05 |
| 1,599 | Semantic Compression and Pattern Extraction with Fascicles | 1999 | VLDB | 0.00011203327 |
| 12,051 | A Direct Mining Approach To Efficient Constrained Graph Pattern Discovery | 2013 | SIGMOD | 4.1905499e-05 |
| 12,698 | Mining Frequent Itemsets Using Support Constraints | 2000 | VLDB | 4.1905499e-05 |
| 4,713 | Mining Graph Patterns Efficiently via Randomized Summaries | 2009 | VLDB | 5.9694403e-05 |
| 12,531 | Mining Frequent Closed Cubes in 3D Datasets | 2006 | VLDB | 4.1905499e-05 |
| 5,773 | Mining Frequent Patterns with Differential Privacy | 2013 | VLDB | 5.3300095e-05 |
| 9,564 | Flexible and Feasible Support Measures for Mining Frequent Patterns in Large Labeled Graphs | 2017 | SIGMOD | 4.3212967e-05 |
| 182 | Mining Frequent Patterns without Candidate Generation | 2000 | SIGMOD | 0.00036955562 |
| 8,315 | A Condensed Representation to Find Frequent Patterns | 2001 | PODS | 4.5392079e-05 |