A Tree Partitioning Method for Memory Management in Association Rule Mining

All methods of association rule mining require the frequent sets of items, that occur together sufficiently often to be the basis of potentially interesting rules, to be first computed. The cost of this increases in proportion to the database size, and also with its density. Densely-populated databases can give rise to very large numbers of candidates that must be counted. Both these factors cause performance problems, especially when the data structures involved become too large for primary memory. In this paper we describe a method of partitioning that organises the data into tree structures that can be processed independently. We present experimental results that show the method scales well for increasing dimensions of data, and performs significantly better than alternatives, especially when dealing with dense data and low support thresholds.

• Type: Conference
• Year: 2004
• Where: DAWAK
• Authors: Shakil Ahmed, Frans Coenen, Paul H. Leng
• Keywords: Association Rule Mining, Data Mining, Data Structures, DAWAK 2004, Factors Cause Performance