Apriori Algorithm !link! Here

Conversely, if an itemset is infrequent, any superset containing it is also infrequent. This is known as the , and it is what makes the algorithm efficient by "pruning" the search space. The Three Key Metrics

Support(A) = (Transactions containing A) / (Total Transactions) apriori algorithm

Continue increasing the size of the itemsets until no more frequent sets can be found. Conversely, if an itemset is infrequent, any superset

It uses a "divide and conquer" strategy that works well on smaller, categorical datasets. if an itemset is infrequent