All subset of any frequent itemset must also be frequent.Example:If Tea, Biscuit, Coffee is a frequent itemset, then we can say that all of the following itemsets are frequent;
Tea
Biscuit
Coffee
Tea, Biscuit
Tea, Coffee
Biscuit, Coffee
Apriori pruning principle
If an itemset is infrequent, its superset should not be generated for getting the frequent itemset.
Examples of Apriori pruning principle
If Tea, Biscuit is a frequent itemset and Coffee is not frequent itemset, then we can say that all of the following itemsets are frequent;
Tea
Biscuit
Tea, Biscuit
Video Lecture
Next Similar Tutorials
Frequent pattern Mining, Closed frequent itemset, max frequent itemset in data mining – Click Here
Support, Confidence, Minimum support, Frequent itemset, K-itemset, absolute support in data mining – Click Here
Apriori Algorithm in Data Mining with examples – Click Here
Apriori principles in data mining, Downward closure property, Apriori pruning principle – Click Here
Apriori candidates’ generations, self-joining, and pruning principles. – Click Here.