| (1) for each vector |
| (2) build the transactions list from the data set; |
| (3) end for each vector |
| (4) for each transactions |
| (5) for each item set from transactions |
| (6) calculate support of 1-item sets |
| (7) create large 1-item sets |
|
(8) for each item set from transactions starting with current |
| (9) create the hash table for 2-item sets |
| (10) end for each item set |
| (11) end for each item set |
| (12) end for each transaction |
| (13) pruning the hash table |
| (14) for each large -item set list while list ≠ ⌀ |
| (15) for each item set from |
| (16) for each item set from starting with current |
| (17) create k-item sets with the hash table |
| (18) create the hash table for k + 1 item sets |
| (19) if is candidate created then |
| (20) for each transactions |
| (21) calculate support of candidate |
| (22) end for each transactions |
| (23) remove candidate with small support |
| (24) end for each item set |
| (25) end for each item set |
| (26) end each large -item set list |
| (27) pruning the hash table |
| (28) for each large -item set list while list ≠ ⌀ |
| (29) for each large -item set from list |
| (30) for each item from large -item set |
| (31) create association rules |
| (32) end for each item |
| (33) end for each large -item set |
| (34) end each large -item set list |
