Pijls, W.H.L.M.; Koster, W.A. - Erasmus University Rotterdam, Econometric Institute - 2005
An improved version of DF, the depth-first implementation of Apriori, is presented. Given a database of (e.g., supermarket) transactions, the DF algorithm builds a so-called trie that contains all frequent itemsets, i.e., all itemsets that are contained in at least `minsup' transactions with...