A Condensed Representation to Find Frequent Patterns

Summary: Introduce disjunction-free sets as a condensed representation of frequent patterns that enables exact regeneration of all frequent itemsets and their frequencies without accessing the original data. Provide efficient extraction algorithms that empirically beat frequent closed sets, often with much lower cost even in hard cases. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID: 1241
Venue: PODS
Year: 2001
Pagerank: 5.4119882e-05
Overall Rank: 8,557 | 41.30%
DOI: 10.1145/375551.375604

Incoming Non-self Citations Over Time

Authors

1. Artur Bykowski (Institut National des Sciences Appliquées de Lyon)
2. Christophe Rigotti (Institut National des Sciences Appliquées de Lyon)

BibTeX Citation

@inproceedings{bykowski_pods01,
        address = {New York, NY, USA},
        series = {{PODS} '01},
        title = {{A Condensed Representation to Find Frequent Patterns}},
        url = {https://dl.acm.org/doi/10.1145/375551.375604},
        doi = {10.1145/375551.375604},
        booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
        publisher = {Association for Computing Machinery},
        author = {Bykowski, Artur and Rigotti, Christophe},
        year = {2001}
}

Incoming Citations (Sorted by Pagerank)

Showing 1 of 1 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank
12,726	Differential Constraints	2005	PODS	5.093636e-05

Outgoing Citations (Sorted by Pagerank)

Showing 3 of 3 cited papers.

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

Rank	Cited Paper	Year	Venue	Pagerank
161	Mining Frequent Patterns without Candidate Generation	2000	SIGMOD	0.00027981772
462	Sampling Large Databases for Association Rules	1996	VLDB	0.00018065337
886	Efficiently Mining Long Patterns from Databases	1998	SIGMOD	0.0001340645

Semantically Similar Papers

#	Overall Rank	Paper	Year	Venue
1	12,241	A Direct Mining Approach To Efficient Constrained Graph Pattern Discovery	2013	SIGMOD
2	12,715	Mining Frequent Closed Cubes in 3D Datasets	2006	VLDB
3	11,249	Efficient Discovery of Significant Patterns with Few-Shot Resampling	2024	VLDB
4	13,997	Mining Frequent Itemsets with Bit Strings and Trie	2002	VLDB
5	12,882	Mining Frequent Itemsets Using Support Constraints	2000	VLDB
6	885	Finding Frequent Items in Data Streams	2008	VLDB
7	9,212	Feasible Itemset Distributions in Data Mining: Theory and Application	2003	PODS
8	5,538	Mining Frequent Patterns with Differential Privacy	2013	VLDB
9	161	Mining Frequent Patterns without Candidate Generation	2000	SIGMOD
10	3,324	Mining Compressed Frequent-Pattern Sets	2005	VLDB