Apriori algorithm: Difference between revisions

Revision as of 15:44, 20 April 2004

Revision as of 15:46, 20 April 2004

Line 9:

Apriori<math>(T,\epsilon)</math>

<math>L_1 \gets \{ </math> large 1-itemsets <math> \} </math>

<math> k \gets 2</math>

'''while''' <math> L_{k-1} \neq \emptyset </math>

<math>C_k \gets </math>Generate<math>(L_k-1)</math>

'''for''' transactions <math>t \in T</math>

<math>C_t \gets </math>Subset<math>(C_k,t)</math>

'''for''' candidates <math>c \in C_t</math>

<math>count[c] \gets count[c]+1</math>