Mining Interesting Infrequent and Frequent Itemsets Based on MLMS Model

MLMS (Multiple Level Minimum Supports) model which uses multiple level minimum supports to discover infrequent itemsets and frequent itemsets simultaneously is proposed in our previous work. The reason to discover infrequent itemsets is that there are many valued negative association rules in them. However, some of the itemsets discovered by the MLMS model are not interesting and ought to be pruned. In one of Xindong Wu's papers [1], a pruning strategy (we call it Wu's pruning strategy here) is used to prune uninteresting itemsets. But the pruning strategy is only applied to single minimum support. In this paper, we modify the Wu's pruning strategy to adapt to the MLMS model to prune uninteresting itemsets and we call the MLMS model with the modified Wu's pruning strategy IMLMS (Interesting MLMS) model. Based on the IMLMS model, we design an algorithm to discover simultaneously both interesting frequent itemsets and interesting infrequent itemsets. The experimental results show the validity of the model.

[1]  Xiangjun Dong,et al.  Study of Positive and Negative Association Rules Based on Multi-confidence and Chi-Squared Test , 2006, ADMA.

[2]  Jiawei Han,et al.  Mining Multiple-Level Association Rules in Large Databases , 1999, IEEE Trans. Knowl. Data Eng..

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

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

[5]  Sushil Jajodia,et al.  Proceedings of the 1993 ACM SIGMOD international conference on Management of data , 1993, SIGMOD 1993.

[6]  D. Madigan,et al.  Proceedings : KDD-99 : the Fifth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, August 15-18, 1999, San Diego, California, USA , 1999 .

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

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

[9]  Dino Pedreschi,et al.  Knowledge Discovery in Databases: PKDD 2004 , 2004, Lecture Notes in Computer Science.

[10]  Xiangjun Dong,et al.  Mining Infrequent Itemsets Based on Multiple Level Minimum Supports , 2007, Second International Conference on Innovative Computing, Informatio and Control (ICICIC 2007).

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

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

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