Mining frequent intemsets in memory-resident databases

Wim Pijls and Cor Bioch

ERIM Report Series Research in Management from Erasmus Research Institute of Management (ERIM), ERIM is the joint research institute of the Rotterdam School of Management, Erasmus University and the Erasmus School of Economics (ESE) at Erasmus University Rotterdam

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.

Keywords: association rules; datamining; frequent itemsets (search for similar items in EconPapers)
JEL-codes: C89 M M11 R4 (search for similar items in EconPapers)
Date: 2000-12-05
References: Add references at CitEc
Citations:

Downloads: (external link)
https://repub.eur.nl/pub/61/erimrs20001205144338.pdf (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ems:eureri:61

Access Statistics for this paper

More papers in ERIM Report Series Research in Management from Erasmus Research Institute of Management (ERIM), ERIM is the joint research institute of the Rotterdam School of Management, Erasmus University and the Erasmus School of Economics (ESE) at Erasmus University Rotterdam Contact information at EDIRC.
Bibliographic data for series maintained by RePub ( this e-mail address is bad, please contact ).