Database Paper Browser

Back to papers

Feasible Itemset Distributions in Data Mining: Theory and Application

Summary: Characterizes feasible length distributions of frequent and maximal itemset collections and derives tight lower bounds on achievable distributions. Applies these bounds to generate realistic synthetic datasets for benchmarking, linking pattern distribution to mining resource costs. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
1300
Venue
PODS
Year
2003
Pagerank
4.4039656e-05
Overall Rank
9,064 | 36.95%
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,354 An Audit Environment for Outsourcing of Frequent Itemset Mining 2009 VLDB 4.1945683e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 5 of 5 cited papers.

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

Previous Page 1 / 1 Next

Semantically Similar Papers