W.A. Koster
http://repub.eur.nl/ppl/8674/
List of Publicationsenhttp://repub.eur.nl/eur_signature.png
http://repub.eur.nl/
RePub, Erasmus University RepositoryHow to find frequent patterns?
http://repub.eur.nl/pub/6850/
Wed, 01 Jun 2005 00:00:01 GMT<div>W.H.L.M. Pijls</div><div>W.A. Koster</div>
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 `minsup' a given threshold value.
In the trie, there is a one-to-one correspondence between the paths and the frequent itemsets.
The new version, called DF+, differs from DF in that its data structure representing the database is borrowed from the FP-growth algorithm. So it combines the compact FP-growth data structure with the efficient trie-building method in DF.