Negative Association Rules

Mining association rules associates events that took place together. In market basket analysis, these discovered rules associate items purchased together. Items that are not part of a transaction are not considered. In other words, typical association rules do not take into account items that are part of the domain but that are not together part of a transaction. Association rules are based on frequencies and count the transactions where items occur together. However, counting absences of items is prohibitive if the number of possible items is very large, which is typically the case. Nonetheless, knowing the relationship between the absence of an item and the presence of another can be very important in some applications. These rules are called negative association rules. We review current approaches for mining negative association rules and we discuss limitations and future research directions.

[1]  Bart Goethals,et al.  FIMI '03, Frequent Itemset Mining Implementations, Proceedings of the ICDM 2003 Workshop on Frequent Itemset Mining Implementations, 19 December 2003, Melbourne, Florida, USA , 2003, FIMI.

[2]  Geoffrey I. Webb,et al.  Mining Negative Rules Using GRD , 2004, PAKDD.

[3]  Philip S. Yu,et al.  A new framework for itemset generation , 1998, PODS '98.

[4]  Hao Wang,et al.  Mining a Complete Set of Both Positive and Negative Association Rules from Large Databases , 2008, PAKDD.

[5]  Osmar R. Zaïane,et al.  Text document categorization by term association , 2002, 2002 IEEE International Conference on Data Mining, 2002. Proceedings..

[6]  Ming-Syan Chen,et al.  On the mining of substitution rules for statistically dependent items , 2002, 2002 IEEE International Conference on Data Mining, 2002. Proceedings..

[7]  Shamkant B. Navathe,et al.  Mining for strong negative associations in a large database of customer transactions , 1998, Proceedings 14th International Conference on Data Engineering.

[8]  Rajeev Motwani,et al.  Dynamic itemset counting and implication rules for market basket data , 1997, SIGMOD '97.

[9]  Philip S. Yu,et al.  Mining Associations with the Collective Strength Approach , 2001, IEEE Trans. Knowl. Data Eng..

[10]  Mohammed J. Zaki.  Parallel and distributed association mining: a survey , 1999, IEEE Concurr..

[11]  Bart Goethals,et al.  Advances in frequent itemset mining implementations: report on FIMI'03 , 2004, SKDD.

[12]  Xindong Wu,et al.  Efficient mining of both positive and negative association rules , 2004, TOIS.

[13]  Osmar R. Zaïane,et al.  An associative classifier based on positive and negative rules , 2004, DMKD '04.

[14]  Xiaohui Yuan,et al.  Mining negative association rules , 2002, Proceedings ISCC 2002 Seventh International Symposium on Computers and Communications.

[15]  Wilhelmiina Hämäläinen,et al.  Kingfisher: an efficient algorithm for searching for both positive and negative dependency rules with statistical significance measures , 2011, Knowledge and Information Systems.

[16]  Philip S. Yu,et al.  Mining Large Itemsets for Association Rules , 1998, IEEE Data Eng. Bull..

[17]  Rajeev Motwani,et al.  Beyond market baskets: generalizing association rules to correlations , 1997, SIGMOD '97.

[18]  Das Amrita,et al.  Mining Association Rules between Sets of Items in Large Databases , 2013 .

[19]  Yun Sing Koh,et al.  Efficiently Finding Negative Association Rules Without Support Threshold , 2007, Australian Conference on Artificial Intelligence.

[20]  Ming-Syan Chen,et al.  A statistical framework for mining substitution rules , 2005, Knowledge and Information Systems.

[21]  Wynne Hsu,et al.  Integrating Classification and Association Rule Mining , 1998, KDD.

[22]  Guoqing Chen,et al.  Mining Positive and Negative Association Rules from Large Databases , 2006, 2006 IEEE Conference on Cybernetics and Intelligent Systems.

[23]  Osmar R. Zaïane,et al.  Mining Positive and Negative Association Rules: An Approach for Confined Rules , 2004, PKDD.

[24]  Jian Pei,et al.  CMAR: accurate and efficient classification based on multiple class-association rules , 2001, Proceedings 2001 IEEE International Conference on Data Mining.

[25]  Wilhelmiina Hämäläinen,et al.  Efficient Discovery of the Top-K Optimal Dependency Rules with Fisher's Exact Test of Significance , 2010, 2010 IEEE International Conference on Data Mining.

[26]  Jian Pei,et al.  Mining frequent patterns without candidate generation , 2000, SIGMOD '00.

[27]  Paul D. McNicholas,et al.  Standardising the lift of an association rule , 2008, Comput. Stat. Data Anal..