A threshold free implication rule mining

Typically, before association rules are mined, a user needs to determine a support threshold in order to obtain only the frequent item sets. Having users to determine a support threshold attracts a number of issues. We propose an association rule mining framework that does not require a pre-set support threshold. The framework is developed based on implication of propositional logic. The experiments show that our approach is able to identify meaningful association rules within an acceptable execution time.

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

[2]  F. Kviz,et al.  Interpreting Proportional Reduction in Error Measures as Percentage of Variation Explained , 1981 .

[3]  Jiuyong Li,et al.  On optimal rule discovery , 2006, IEEE Transactions on Knowledge and Data Engineering.

[4]  Wen-Yang Lin,et al.  A Confidence-Lift Support Specification for Interesting Associations Mining , 2002, PAKDD.

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

[6]  Ling Zhou,et al.  Efficient association rule mining among both frequent and infrequent items , 2007, Comput. Math. Appl..

[7]  Oscar Castillo,et al.  Proceedings of the International MultiConference of Engineers and Computer Scientists 2007, IMECS 2007, March 21-23, 2007, Hong Kong, China , 2007, IMECS.

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

[9]  Yun Sing Koh,et al.  Finding Sporadic Rules Using Apriori-Inverse , 2005, PAKDD.

[10]  Ramakrishnan Srikant,et al.  Mining quantitative association rules in large relational tables , 1996, SIGMOD '96.

[11]  A. J. Feelders,et al.  MAMBO: Discovering Association Rules Based on Conditional Independencies , 2001, IDA.

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

[13]  Yun Sing Koh,et al.  Mining interesting imperfectly sporadic rules , 2006, Knowledge and Information Systems.

[14]  Hui Xiong,et al.  Mining confident co-location rules without a support threshold , 2003, SAC '03.

[15]  Geoffrey I. Webb,et al.  Further Pruning for Efficient Association Rule Discovery , 2001, Australian Joint Conference on Artificial Intelligence.

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

[17]  Gregory Piatetsky-Shapiro,et al.  Discovery, Analysis, and Presentation of Strong Rules , 1991, Knowledge Discovery in Databases.

[18]  Edith Cohen,et al.  Finding interesting associations without support pruning , 2000, Proceedings of 16th International Conference on Data Engineering (Cat. No.00CB37073).

[19]  Bala Srinivasan,et al.  Mining infrequent and interesting rules from transaction records , 2008 .

[20]  Geoffrey I. Webb,et al.  K-Optimal Rule Discovery , 2005, Data Mining and Knowledge Discovery.

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