Template-Type: ReDIF-Paper 1.0
Author-Name: Pijls, W.H.L.M.
Author-Name-Last: Pijls
Author-Name-First: Wim
Author-Name: Bioch, J.C.
Author-Name-Last: Bioch
Author-Name-First: Cor
Title: Mining frequent intemsets in memory-resident databases
Abstract: Due to the present-day memory sizes, a memory-resident database has become a practical option. Consequently, new methods designed to mining in such databases are desirable.  In the case of disk-resident databases, breadth-first search methods are commonly used. We propose a new algorithm, based upon depth-first search in a set-enumeration tree. For memory-resident databases, this method turns out to be superior to breadth-first search.
Creation-Date: 2000-12-05
File-URL: https://repub.eur.nl/pub/61/erimrs20001205144338.pdf
File-Format: application/pdf
Series: RePEc:ems:eureri
Number: ERS-2000-53-LIS
Classification-JEL: C89, M, M11, R4
Keywords: association rules, datamining, frequent itemsets
Handle: RePEc:ems:eureri:61