Affiliations: [a] Department of Computer Science, The University of Auckland, Auckland, New Zealand | [b] School of Computer and Mathematical Science, Auckland University of Technology, Auckland, New Zealand
Correspondence:
[*]
Corresponding author: Yun Sing Koh, Department of Computer Science, The University of Auckland, Private Bag 92019, Auckland 1142, New Zealand. E-mail: ykoh@cs.auckland.ac.nz.
Abstract: Typically association rule mining only considers positive frequent itemsets in rule generation, where rules involving only the presence of items are generated. In this paper we consider the complementary problem of negative association rule mining, which generates rules describing the absence of itemsets from transactions. We describe a new approach called MINR (Mining Interesting Negative Rules) to efficiently find all interesting negative association rules. In our approach, we only consider the presence or absence of itemsets that are strongly associated. Our approach does not require a user defined support threshold, and is based on pruning coincidental itemsets. For every individual itemset we calculate two custom thresholds based on their support: the positive and negative chance thresholds. Itemsets whose support falls above their positive chance threshold are considered positively associated whereas itemsets whose support falls below its negative chance threshold are considered negatively associated. We compared our implementation against Pearson ϕ correlation and we note that MINR was able to generate sets of rules which are more interesting.
Keywords: Association rule mining, sporadic rules, fisher exact test, negative association rules, chance threshold
