Compute Large Itemsets - Algorithm Apriori

Making multiple passes over the data

for pass k

{

candidate generation: Ck Lk-1;

support counting in Ck;

Lk = All candidates in Ck with minimum support;

}

terminate when Lk== or Ck+1==

Large-Itemsets = k Lk

Lk - Set of frequent itemsets of size k. (those with minsup)

Ck - Set of candidate itemsets of size k.

(potentially large itemsets)

Previous slide

Next slide

Back to first slide

View graphic version