On data structures for association rule discovery

Publication Type:
Journal Article
Applied Artificial Intelligence, 2007, 21 (2), pp. 57 - 79
Issue Date:
Filename Description Size
Thumbnail2007000685.pdf957.67 kB
Adobe PDF
Full metadata record
Systematically we study data structures used to implement the algorithms of association rule mining, including hash tree, itemset tree, and FP-tree (frequent pattern tree). Further, we present a generalized FP-tree in an applied context. This assists in better understanding existing association-rule-mining strategies. In addition, we discuss and analyze experimentally the generalized k-FP-tree, and demonstrate that the generalized FP-tree reduces the computation costs significantly. This study will be useful to many association analysis tasks where one must provide really interesting rules and develop efficient algorithms for identifying association rules.
Please use this identifier to cite or link to this item: