2000-12-05
Mining frequent intemsets in memory-resident databases
Publication
Publication
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.
Additional Metadata | |
---|---|
, , | |
, , , | |
Erasmus Research Institute of Management | |
hdl.handle.net/1765/61 | |
ERIM Report Series Research in Management | |
Organisation | Erasmus Research Institute of Management |
Pijls, W., & Bioch, C. (2000). Mining frequent intemsets in memory-resident databases (No. ERS-2000-53-LIS). ERIM Report Series Research in Management. Retrieved from http://hdl.handle.net/1765/61 |