Mining Frequent Itemsets Using Support Constraints

Summary: Introduces constrained frequent-itemset mining where minimum support varies by itemset, avoiding uniform-support Apriori’s missed low-support patterns and excessive generation. Pushes support constraints into candidate generation, selecting each itemset’s best runtime threshold while retaining Apriori pruning. (summarized by gpt-5.6-luna on Jul 24 2026)

Paper ID: h0f90a4086648c6ce
Venue: VLDB
Year: 2000
Pagerank: 4.9793485e-05
Overall Rank: 13,172 | 11.44%
DOI: -

Incoming Non-self Citations Over Time

No non-self incoming citations found for this paper in this database.

Authors

1. Ke Wang (National University of Singapore; Simon Fraser University)
2. Yu He (National University of Singapore)
3. Jiawei Han (Simon Fraser University)

BibTeX Citation

@article{wang_vldb00,
        title = {{Mining Frequent Itemsets Using Support Constraints}},
        author = {Wang, Ke and He, Yu and Han, Jiawei},
        journal = {PVLDB},
        series = {{VLDB} '00},
        pages = {43--52},
        year = {2000}
}

Incoming Citations (Sorted by Pagerank)

Showing 0 of 0 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank

Outgoing Citations (Sorted by Pagerank)

Showing 11 of 11 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.00064420972
29	Fast Algorithms for Mining Association Rules	1994	VLDB	0.0005121339
164	Mining Frequent Patterns without Candidate Generation	2000	SIGMOD	0.00027412227
250	An Effective Hash-Based Algorithm for Mining Association Rules	1995	SIGMOD	0.00023156569
467	Discovery of Multiple-Level Association Rules from Large Databases	1995	VLDB	0.00017766906
475	Mining Generalized Association Rules	1995	VLDB	0.00017672519
573	An Efficient Algorithm for Mining Association Rules in Large Databases	1995	VLDB	0.00016173338
721	Dynamic Itemset Counting and Implication Rules for Market Basket Data	1997	SIGMOD	0.0001452081
731	Beyond Market Baskets: Generalizing Association Rules to Correlations	1997	SIGMOD	0.00014394521
4,926	Building Hierarchical Classifiers Using Class Proximity	1999	VLDB	6.3508104e-05
5,760	A New Framework For Itemset Generation	1998	PODS	6.0038837e-05

Semantically Similar Papers

#	Overall Rank	Paper	Year	Venue
1	14,308	Mining Frequent Itemsets with Bit Strings and Trie	2002	VLDB
2	1,453	PrivBasis: Frequent Itemset Mining with Differential Privacy	2012	VLDB
3	164	Mining Frequent Patterns without Candidate Generation	2000	SIGMOD
4	29	Fast Algorithms for Mining Association Rules	1994	VLDB
5	2,416	On Differentially Private Frequent Itemset Mining	2013	VLDB
6	5,302	An Efficient Rigorous Approach for Identifying Statistically Significant Frequent Itemsets	2009	PODS
7	9,390	Feasible Itemset Distributions in Data Mining: Theory and Application	2003	PODS
8	7,810	Mining Frequent Itemsets over Uncertain Databases	2012	VLDB
9	4,444	Online Association Rule Mining	1999	SIGMOD
10	12,442	Beyond Itemsets: Mining Frequent Featuresets over Structured Items	2015	VLDB