Mining Frequent Itemsets Using Support Constraints

Summary: Framework for mining frequent itemsets with support constraints, enabling nonuniform minimum support across itemsets. By pushing constraints into Apriori generation, it uses per-itemset run-time minimums to prune search and preserve Apriori efficiency. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID: 8633
Venue: VLDB
Year: 2000
Pagerank: 4.1945683e-05
Overall Rank: 12,689 | 11.73%
DOI: -

Incoming Non-self Citations Over Time

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

Authors

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.0010864752
36	Fast Algorithms for Mining Association Rules	1994	VLDB	0.00076161096
117	An Effective Hash-Based Algorithm for Mining Association Rules	1995	SIGMOD	0.00045896865
181	Mining Frequent Patterns without Candidate Generation	2000	SIGMOD	0.00036992674
227	Discovery of Multiple-Level Association Rules from Large Databases	1995	VLDB	0.00032284058
403	Mining Generalized Association Rules	1995	VLDB	0.00024148455
547	An Efficient Algorithm for Mining Association Rules in Large Databases	1995	VLDB	0.00020420717
657	Dynamic Itemset Counting and Implication Rules for Market Basket Data	1997	SIGMOD	0.00018553891
744	Beyond Market Baskets: Generalizing Association Rules to Correlations	1997	SIGMOD	0.00017333019
2,325	Building Hierarchical Classifiers Using Class Proximity	1999	VLDB	9.0304462e-05
5,565	A New Framework For Itemset Generation	1998	PODS	5.4318211e-05

Semantically Similar Papers

Overall Rank	Paper	Year	Venue	Pagerank
13,796	Mining Frequent Itemsets with Bit Strings and Trie	2002	VLDB	-
1,567	PrivBasis: Frequent Itemset Mining with Differential Privacy	2012	VLDB	0.0001133268
181	Mining Frequent Patterns without Candidate Generation	2000	SIGMOD	0.00036992674
36	Fast Algorithms for Mining Association Rules	1994	VLDB	0.00076161096
2,685	On Differentially Private Frequent Itemset Mining	2013	VLDB	8.3070708e-05
4,829	An Efficient Rigorous Approach for Identifying Statistically Significant Frequent Itemsets	2009	PODS	5.8925807e-05
9,064	Feasible Itemset Distributions in Data Mining: Theory and Application	2003	PODS	4.4039656e-05
7,633	Mining Frequent Itemsets over Uncertain Databases	2012	VLDB	4.6914549e-05
4,258	Online Association Rule Mining	1999	SIGMOD	6.3148619e-05
11,952	Beyond Itemsets: Mining Frequent Featuresets over Structured Items	2015	VLDB	4.1945683e-05