Mining and Ranking Association Rules in Support, Confidence, Correlation, and Dissociation Framework

Existing methods in association rule mining based on traditional support-confidence framework generates huge number of frequent patterns and association rules often ignoring the dissociation among items. Moreover these procedures are unable to order the rules by comparing them to find which one is better than whom. We have introduced a new algorithm for mining frequent patterns based on support and dissociation and thereafter generating rules based on confidence and correlation. The association rules have been ranked based on a composite index computed from the four measures. The experimental results obtained after implementation of the proposed algorithm justify our approach.

[1]  Vincent S. Tseng,et al.  Mining Top-K Non-redundant Association Rules , 2012, ISMIS.

[2]  Wee Keong Ng,et al.  Rapid association rule mining , 2001, CIKM '01.

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

[4]  Jianyong Wang,et al.  HARMONY: Efficiently Mining the Best Rules for Classification , 2005, SDM.

[5]  Subrata Datta,et al.  Frequent pattern generation in association rule mining using weighted support , 2015, Proceedings of the 2015 Third International Conference on Computer, Communication, Control and Information Technology (C3IT).

[6]  Mikolaj Morzy,et al.  Efficient Mining of Dissociation Rules , 2006, DaWaK.

[7]  Sukomal Pal,et al.  Association against dissociation: some pragmatic considerations for frequent itemset generation under fixed and variable thresholds , 2005, SKDD.

[8]  Ke Sun,et al.  Mining Weighted Association Rules without Preassigned Weights , 2008, IEEE Transactions on Knowledge and Data Engineering.

[9]  Vincent S. Tseng,et al.  Mining Top-K Association Rules , 2012, Canadian Conference on AI.

[10]  Ramakrishnan Srikant,et al.  Fast algorithms for mining association rules , 1998, VLDB 1998.

[11]  Mitica Craus,et al.  A New Parallel Algorithm for the Frequent Itemset Mining Problem , 2008, 2008 International Symposium on Parallel and Distributed Computing.

[12]  Mitica Craus,et al.  A generalized parallel algorithm for frequent itemset mining , 2008 .

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

[14]  Jian Pei,et al.  Mining frequent patterns by pattern-growth: methodology and implications , 2000, SKDD.

[15]  Ron Kohavi,et al.  Real world performance of association rule algorithms , 2001, KDD '01.

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

[17]  Ujjwal Maulik,et al.  RANWAR: Rank-Based Weighted Association Rule Mining From Gene Expression and Methylation Data , 2015, IEEE Transactions on NanoBioscience.

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

[19]  Subrata Bose,et al.  Discovering association rules partially devoid of dissociation by weighted confidence , 2015, 2015 IEEE 2nd International Conference on Recent Trends in Information Systems (ReTIS).

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

[21]  Peter A. Flach,et al.  Rule Evaluation Measures: A Unifying View , 1999, ILP.

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

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