A Preliminary Study of Closed Generalized Itemsets and Their Enumeration Algorithms

In this paper, we propose a new form of itemset, i.e., a generalized itemset consisting of both positive and negative items. The generalized itemset has more expressive power and can extend the association rules. We firstly study some basic properties of a closed generalized itemset, such as the closure. Next, we propose three sorts of algorithms enumerating all closed generalized itemsets. Finally, we show some preliminary results for comparing the performances of these enumeration methods through experiments.