Template-Type: ReDIF-Paper 1.0
Author-Name: Pijls, W.H.L.M.
Author-Name-Last: Pijls
Author-Name-First: Wim
Author-Name: Koster, W.A.
Author-Name-Last: Koster
Title: How to find frequent patterns?
Abstract: 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.
Creation-Date: 2005-06-01
File-URL: https://repub.eur.nl/pub/6850/ei2005-24.pdf
File-Format: application/pdf
Series: RePEc:ems:eureir
Number: EI 2005-24
Handle: RePEc:ems:eureir:6850