Illustrating Apriori Principle Item Count Items(1-itemsets) Bread oke Milk Itemset Count Pairs(2-itemsets) Beer Diaper 424341 Bread, Milk) 3 Eggs bRead, Beer 2(No need to generate (Bread, Diaper) 3 candidates involving Coke MIlk, Beer 2 or Eggs) IMilk, Diaper] 3 [Beer, Diaper 3 Minimum Support =3 Triplets(3-itemsets) If every subset is considered Itemset Count 6C1+6C2+6C3=41 Bread, Milk, Diaper 3 With support-based pruning 6+6+1=13 n Steinbach. Kumar Introduction to Data Mining 4/18/2004© Tan,Steinbach, Kumar Introduction to Data Mining 4/18/2004 ‹#› Illustrating Apriori Principle Item Count Bread 4 Coke 2 Milk 4 Beer 3 Diaper 4 Eggs 1 Itemset Count {Bread,Milk} 3 {Bread,Beer} 2 {Bread,Diaper} 3 {Milk,Beer} 2 {Milk,Diaper} 3 {Beer,Diaper} 3 Itemset Count {Bread,Milk,Diaper} 3 Items (1-itemsets) Pairs (2-itemsets) (No need to generate candidates involving Coke or Eggs) Triplets (3-itemsets) Minimum Support = 3 If every subset is considered, 6C1 + 6C2 + 6C3 = 41 With support-based pruning, 6 + 6 + 1 = 13