Download This PaperMining Frequent Intemsets in Memory-Resident Databases
16 Pages Posted: 26 Aug 2006
Date Written: December 5, 2000
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
JEL Classification: R4, M, M11, C89
Suggested Citation: Suggested Citation
Pijls, Wim and Bioch, Jan C., Mining Frequent Intemsets in Memory-Resident Databases (December 5, 2000). ERIM Report Series Reference No. ERS-2000-53-LIS, Available at SSRN: https://ssrn.com/abstract=370855
Erasmus Research Institute of Management (ERIM)
P.O. Box 1738
3000 DR Rotterdam
Netherlands
Feedback
Feedback to SSRN
If you need immediate assistance, call 877-SSRNHelp (877 777 6435) in the United States, or +1 212 448 2500 outside of the United States, 8:30AM to 6:00PM U.S. Eastern, Monday - Friday.