Database Paper Browser

Back to papers

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
1242
Venue
PODS
Year
2001
Pagerank
4.5392079e-05
Overall Rank
8,315 | 42.22%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 1 of 1 citing papers.

Rank Citing Paper Year Venue Pagerank
12,542 Differential Constraints 2005 PODS 4.1905499e-05
Previous Page 1 / 1 Next

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
182 Mining Frequent Patterns without Candidate Generation 2000 SIGMOD 0.00036955562
473 Sampling Large Databases for Association Rules 1996 VLDB 0.00022304724
829 Efficiently Mining Long Patterns from Databases 1998 SIGMOD 0.00016137512
Previous Page 1 / 1 Next

Semantically Similar Papers