[2N4-OS-17a] OS-17 (1)

[2N4-OS-17a-04] Fast Enumeration of Pairs of Minimal Generators and Their Closure Itemsets

〇Takahiro Nabeshima¹, Koji Iwanuma² (1. Conputer Science and Engineering Course, Integrated Graduate School of Medicine, Engineering and Agricultural Sciences, University of Yamanashi, 2. Interdisciplinary Graduate School, University of Yamanashi)

Keywords:Minimal Generator, Closure Itemset, Closed Itemset, Fast Enumeration

In this paper, we propose a fast method for enumerating pairs of minimal generators and their closure itensets. A minimal generator is a lossless compressed forms of itemsets. And those set is used to compress negative association rules. The number of negative association rules extracted from a transaction database is extremely large, compared with the one of ordinary positive association rules. Therefore, some compression technique for negative rules is an inevitable and rational solution for efficient negative rule mining. We give a fast method for enumerating pairs of minimal generators and their closure itensets, which takes the form of a depth-first search over a suffix tree consisting of frequent minimal generators only. We also show some preliminary results of evaluation experiments.