機器學習方法之 - Apriori Algorithm

procedure AprioriAlgorithm() 
begin 
  L[1] := {frequent 1-itemsets}; 
  for k = 2 to K
    C[k]= apriori-gen(L[k-1]) ; // new candidates 
    for all transactions t in the dataset
      for all candidates c Ck contained in t
        c:count++ 
    L[k] = { c | c:count >= min-support} 
  Answer := L[k]
end