Study of Positive and Negative Association Rules Based on Multi-confidence and Chi-Squared Test

Using a single confidence threshold will result in a dilemmatic situation when simultaneously studying positive and negative association rule (PNAR), i.e., the forms A$\Rightarrow$B, A$\Rightarrow$¬B, ¬A$\Rightarrow$B and ¬A$\Rightarrow$¬B. A method based on four confidence thresholds for the four forms of PNARs is proposed. The relationships among the four confidences, which show the necessity of using multiple confidence thresholds, are also discussed. In addition, the chi-squared test can avoid generating misleading rules that maybe occur when simultaneously studying the PNARs. The method of how to apply chi-squared test in mining association rules is discussed. An algorithm PNARMC based on the chi-squared test and the four confidence thresholds is proposed. The experimental results demonstrate that the algorithm can not only generate PNARs rightly, but can also control the total number of rules flexibly.

[1]  Lu Yuchang,et al.  Study on Negative Association Rules , 2004 .

[2]  Sergio A. Alvarez,et al.  Chi-squared computation for association rules: preliminary results , 2003 .

[3]  Wynne Hsu,et al.  Identifying non-actionable association rules , 2001, KDD '01.

[4]  Wynne Hsu,et al.  Mining association rules with multiple minimum supports , 1999, KDD '99.

[5]  Howard J. Hamilton,et al.  Applying Objective Interestingness Measures in Data Mining Systems , 2000, PKDD.

[6]  Pang-Ning Tan,et al.  Interestingness Measures for Association Patterns : A Perspective , 2000, KDD 2000.

[7]  Xindong Wu,et al.  Mining Both Positive and Negative Association Rules , 2002, ICML.

[8]  Jean-François Boulicaut,et al.  Towards the Tractable Discovery of Association Rules with Negations , 2000, FQAS.

[9]  Chengqi Zhang,et al.  Association Rule Mining , 2002, Lecture Notes in Computer Science.

[10]  Tomasz Imielinski,et al.  Mining association rules between sets of items in large databases , 1993, SIGMOD Conference.

[11]  Li Xue THE EXTENDED ASSOCIATION RULES AND ATOM ASSOCIATION RULES , 2002 .

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

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

[14]  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.

[15]  Rajeev Motwani,et al.  Beyond Market Baskets: Generalizing Association Rules to Dependence Rules , 1998, Data Mining and Knowledge Discovery.

[16]  MotwaniRajeev,et al.  Beyond market baskets , 1997 .

[17]  Jaideep Srivastava,et al.  Selecting the right interestingness measure for association patterns , 2002, KDD.