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: 1299
Venue: PODS
Year: 2003
Pagerank: 5.3058708e-05
Overall Rank: 9,212 | 36.80%
DOI: 10.1145/773153.773181

Incoming Non-self Citations Over Time

Authors

1. Ganesh Ramesh (State University of New York Albany)
2. William A. Maniatty (State University of New York Albany)
3. Mohammed J. Zaki (Rensselaer Polytechnic Institute)

BibTeX Citation

@inproceedings{ramesh_pods03,
        address = {New York, NY, USA},
        series = {{PODS} '03},
        title = {{Feasible Itemset Distributions in Data Mining: Theory and Application}},
        url = {https://dl.acm.org/doi/10.1145/773153.773181},
        doi = {10.1145/773153.773181},
        booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
        publisher = {Association for Computing Machinery},
        author = {Ramesh, Ganesh and Maniatty, William A. and Zaki, Mohammed J.},
        year = {2003}
}

Incoming Citations (Sorted by Pagerank)

Showing 1 of 1 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank
12,547	An Audit Environment for Outsourcing of Frequent Itemset Mining	2009	VLDB	5.093636e-05

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.

Rank	Cited Paper	Year	Venue	Pagerank
161	Mining Frequent Patterns without Candidate Generation	2000	SIGMOD	0.00027981772
558	An Efficient Algorithm for Mining Association Rules in Large Databases	1995	VLDB	0.00016530269
704	Dynamic Itemset Counting and Implication Rules for Market Basket Data	1997	SIGMOD	0.00014837704
886	Efficiently Mining Long Patterns from Databases	1998	SIGMOD	0.0001340645
6,578	Data mining, Hypergraph Transversals, and Machine Learning	1997	PODS	5.8364579e-05

Semantically Similar Papers

#	Overall Rank	Paper	Year	Venue
1	4,683	False Positive or False Negative: Mining Frequent Itemsets from High Speed Transactional Data Streams	2004	VLDB
2	12,176	Resource-oriented Approximation for Frequent Itemset Mining from Bursty Data Streams	2014	SIGMOD
3	12,882	Mining Frequent Itemsets Using Support Constraints	2000	VLDB
4	12,150	Beyond Itemsets: Mining Frequent Featuresets over Structured Items	2015	VLDB
5	14,090	Towards Data Mining Benchmarking: A Test Bed for Performance Study of Frequent Pattern Mining	2000	SIGMOD
6	2,366	On Differentially Private Frequent Itemset Mining	2013	VLDB
7	5,179	An Efficient Rigorous Approach for Identifying Statistically Significant Frequent Itemsets	2009	PODS
8	7,926	Space Lower Bounds for Itemset Frequency Sketches	2016	PODS
9	885	Finding Frequent Items in Data Streams	2008	VLDB
10	7,657	Mining Frequent Itemsets over Uncertain Databases	2012	VLDB