Apriori Algorithm

L1 = {frequent 1-itemsets}; k = 2;

while (Lk-1 ? ?) do

Ck = candidate itemsets from Lk-1

forall transactions t ? DBASE do
forall candidate itemsets c ? t do

count[c] = count[c] + 1

Lk = All c ? Ck with minimum support
k++

Previous slide

Next slide

Back to first slide

View graphic version