Mining Compressed Frequent-Pattern Sets

Summary: Compresses enormous frequent-pattern outputs by δ-clustering patterns and selecting representatives—an NP-hard set-cover-like problem. Greedy RPglobal (bounded) and RPlocal (fast) achieve near-identical quality, reducing closed patterns nearly 100×; hybridization balances quality and efficiency. (summarized by gpt-5.6-luna on Jul 24 2026)

Paper ID: 9540
Venue: VLDB
Year: 2005
Pagerank: 7.5198821e-05
Overall Rank: 3,324 | 77.20%
DOI: -

Incoming Non-self Citations Over Time

Authors

1. Dong Xin (University of Illinois Urbana-Champaign)
2. Jiawei Han (University of Illinois Urbana-Champaign)
3. Xifeng Yan (University of Illinois Urbana-Champaign)
4. Hong Cheng (University of Illinois Urbana-Champaign)

BibTeX Citation

@article{xin_vldb05,
        title = {{Mining Compressed Frequent-Pattern Sets}},
        author = {Xin, Dong and Han, Jiawei and Yan, Xifeng and Cheng, Hong},
        journal = {PVLDB},
        series = {{VLDB} '05},
        pages = {709},
        year = {2005}
}

Incoming Citations (Sorted by Pagerank)

Showing 5 of 5 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank
326	FG-Index: Towards Verification-Free Query Processing on Graph Databases	2007	SIGMOD	0.00021152829
5,179	An Efficient Rigorous Approach for Identifying Statistically Significant Frequent Itemsets	2009	PODS	6.3299352e-05
5,603	Output Space Sampling for Graph Patterns	2009	VLDB	6.153476e-05
8,229	Mining Approximate Top-K Subspace Anomalies in Multi-Dimensional Time-Series Data	2007	VLDB	5.4620216e-05
12,292	A Performance Study of Three Disk-based Structures for Indexing and Querying Frequent Itemsets	2013	VLDB	5.093636e-05

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.0006567919
27	Fast Algorithms for Mining Association Rules	1994	VLDB	0.00052255472
161	Mining Frequent Patterns without Candidate Generation	2000	SIGMOD	0.00027981772
711	Beyond Market Baskets: Generalizing Association Rules to Correlations	1997	SIGMOD	0.00014713746
886	Efficiently Mining Long Patterns from Databases	1998	SIGMOD	0.0001340645
1,626	Scalable Techniques for Mining Causal Structures	1998	VLDB	0.00010190299

Semantically Similar Papers

#	Overall Rank	Paper	Year	Venue
1	5,401	Towards Proximity Pattern Mining in Large Graphs	2010	SIGMOD
2	1,721	Semantic Compression and Pattern Extraction with Fascicles	1999	VLDB
3	12,241	A Direct Mining Approach To Efficient Constrained Graph Pattern Discovery	2013	SIGMOD
4	12,882	Mining Frequent Itemsets Using Support Constraints	2000	VLDB
5	4,581	Mining Graph Patterns Efficiently via Randomized Summaries	2009	VLDB
6	12,715	Mining Frequent Closed Cubes in 3D Datasets	2006	VLDB
7	5,538	Mining Frequent Patterns with Differential Privacy	2013	VLDB
8	9,703	Flexible and Feasible Support Measures for Mining Frequent Patterns in Large Labeled Graphs	2017	SIGMOD
9	161	Mining Frequent Patterns without Candidate Generation	2000	SIGMOD
10	8,557	A Condensed Representation to Find Frequent Patterns	2001	PODS