Content deleted Content added
m →Overview: Consistent assignment operator |
→Overview: Pseudocode: Clearer names |
||
Line 13:
'''Apriori'''(T, ε)
L<sub>1</sub> ← {large
k ← 2
'''while''' L<sub>k−1</sub> '''is not''' empty
C<sub>k</sub> ←
'''for''' transactions t '''in''' T
D<sub>t</sub> ← {c in C<sub>k</sub> : c ⊆ t}
Line 27:
'''return''' Union(L<sub>k</sub>)
'''
result ←
'''for all''' p ∈ L, q ∈ L '''where''' p<sub>1</sub> = q<sub>1</sub>, p<sub>2</sub> = q<sub>2</sub>, ..., p<sub>k-2</sub> = q<sub>k-2</sub> and p<sub>k-1</sub> < q<sub>k-1</sub>
c ← p ∪ {q<sub>k-1</sub>}
| |||