Koster, W.A.

database itemset algorithm transaction figure support fp-tree fp-growth number pattern execution fp-growth algorithm data structure mining memory result right figure 3 df algorithm chess depth example right axis bucket implementation procedure count accident threshold counter structure right hand side data mining proceeding second itemset i experiment apriori paper complexity conference subtrie minsup scale pointer trie t order transaction database figure 2. execution time item i knowledge discovery value threshold value iteration transaction databases runtime transaction r research section record koster association support thresholds association rules wim pijls walter itemset mining implementations e-mail kosters @liacs machine mining association rules insertion process proceeds data mining issues erasmus university rotterdam netherland bucket i 1 property problem t 40i note supermarket transaction data child