数据挖掘基础:在数据中寻找相关的项目 Apriori算法

Ck: Candidate itemset of size k
Lk : frequent itemset of size k


L1 = {frequent items};
for (k = 1; Lk !=; k++) do begin
    Ck+1 = candidates generated from Lk;
    for each transaction t in database do
  increment the count of all candidates in Ck+1 that are contained in t
    Lk+1  = candidates in Ck+1 with min_support
    end
return k Lk;
Ck: Candidate itemset of size k
Lk : frequent item