Discovering association rules partially devoid of dissociation by weighted confidence

Useful rule formation from frequent itemsets in a large database is a crucial task in Association Rule mining. Traditionally association rules refer to associations between two frequent sets and measured by their confidence. This approach basically concentrates on positive associations and thereby do not study the effect of dissociation and null transactions in association. Though the effect of dissociation has been studied in association, the impact of null transactions has been generally ignored. Some scholars have identified both positive and negative rules and thus studied the impact of the null transactions. However there is no uniform treatment towards inclusion of null transactions in either positive or negative category. We have tried to bridge these gaps. We have established a uniform approach to mine association rules by combining the effect of all kinds of transactions in the rules without categorizing them as positives and negatives. We have proposed to identify the frequent sets by weighted support in lieu of support and measure rules by weighted confidence in lieu of confidence for useful positive rule generation taking care of the negativity through dissociation and Null Transaction Impact Factor. We have shown that the weighted support, weighted confidence approach increases the chance of discovering rules which are less dissociated compared to the traditional support-confidence framework provided we maintain same level of minsupp and minconf in both cases.

[1]  Frans Coenen,et al.  A new method for mining Frequent Weighted Itemsets based on WIT-trees , 2013, Expert Syst. Appl..

[2]  José Francisco Martínez Trinidad,et al.  Mining frequent patterns and association rules using similarities , 2013, Expert Syst. Appl..

[3]  Philip S. Yu,et al.  Efficient mining of weighted association rules (WAR) , 2000, KDD '00.

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

[5]  S. Niwattanakul,et al.  Using of Jaccard Coefficient for Keywords Similarity , 2022 .

[6]  B. Nath,et al.  Incremental association rule mining: a survey , 2013, WIREs Data Mining Knowl. Discov..

[7]  Zhigang Xu,et al.  An Effective Algorithm for Mining Positive and Negative Association Rules , 2008, 2008 International Conference on Computer Science and Software Engineering.

[8]  M. Sulaiman Khan,et al.  Fuzzy Weighted Association Rule Mining with Weighted Support and Confidence Framework , 2009, PAKDD Workshops.

[9]  Diane J. Cook,et al.  Approximate Association Rule Mining , 2001, FLAIRS Conference.

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

[11]  Xiangjun Dong,et al.  Mining Both Positive and Negative Weighted Association Rules with Multiple Minimum Supports , 2008, 2008 International Conference on Computer Science and Software Engineering.

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

[13]  Fionn Murtagh,et al.  Weighted Association Rule Mining using weighted support and significance framework , 2003, KDD '03.

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

[15]  A. Govardhan,et al.  Mining positive and negative association rules , 2010, 2010 5th International Conference on Computer Science & Education.

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

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

[19]  Ada Wai-Chee Fu,et al.  Mining association rules with weighted items , 1998, Proceedings. IDEAS'98. International Database Engineering and Applications Symposium (Cat. No.98EX156).

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

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

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

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

[24]  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).

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

[26]  D. Ramkumar,et al.  Weighted Association Rules: Model and Algorithm , 1998 .

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