Brief Outline

1. generate candidates of size k = 1
   1. create 1 itemset for each regular item

   2. create event items and itemsets for them

2. count support of candidate itemsets of size k = 1

3. add itemsets with support above minimum to frequent itemsets of size k list

4. generate candidates of size k = 2

5. count support of candidate itemsets of size k

6. add itemsets with support above minimum to frequent itemsets of size k list

7. generate candidates of size k + 1

8. continue repeating steps 5, 6, and 7 until no more candidates can be generated

9. generate association rules from frequent itemsets