TRARM-RelSup: Targeted Rare Association Rule Mining Using Itemset Trees and the Relative Support Measure

The goal of association mining is to find potentially interesting rules in large repositories of data. Unfortunately using a minimum support threshold, a standard practice to improve the association mining processing complexity, can allow some of these rules to remain hidden. This occurs because not all rules which have high confidence have a high support count. Various methods have been proposed to find these low support rules, but the resulting increase in complexity can be prohibitively expensive. In this paper, we propose a novel targeted association mining approach to rare rule mining using the itemset tree data structure (aka TRARM-RelSup). This algorithm combines the efficiency of targeted association mining querying with the capabilities of rare rule mining; this results in discovering a more focused, standard and rare rules for the user, while keeping the complexity manageable.

[1]  Yu Li,et al.  Searching for high-support itemsets in itemset trees , 2006, Intell. Data Anal..

[2]  Colin Cooper,et al.  Realistic Synthetic Data for Testing Association Rule Mining Algorithms for Market Basket Databases , 2007, PKDD.

[3]  Vijay V. Raghavan,et al.  The Item-Set Tree: A Data Structure for Data Mining , 1999, DaWaK.

[4]  P. Krishna Reddy,et al.  An improved multiple minimum support based approach to mine rare association rules , 2009, 2009 IEEE Symposium on Computational Intelligence and Data Mining.

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

[6]  Torsten Suel,et al.  Web Information Systems Engineering - WISE 2010 - 11th International Conference, Hong Kong, China, December 12-14, 2010. Proceedings , 2010, WISE.

[7]  Amedeo Napoli,et al.  Towards Rare Itemset Mining , 2007 .

[8]  Ramakrishnan Srikant,et al.  Mining generalized association rules , 1995, Future Gener. Comput. Syst..

[9]  Shamkant B. Navathe,et al.  Text Mining and Ontology Applications in Bioinformatics and GIS , 2007, International Conference on Machine Learning and Applications.

[10]  Ramakrishnan Srikant,et al.  Fast Algorithms for Mining Association Rules in Large Databases , 1994, VLDB.

[11]  Zongyao Sha,et al.  Mining association rules from dataset containing predetermined decision itemset and rare transactions , 2011, 2011 Seventh International Conference on Natural Computation.

[12]  Lei Wu,et al.  Rare Itemset Mining , 2007, ICMLA 2007.

[13]  Tai-Wen Yue,et al.  A Q'tron Neural-Network Approach to Solve the Graph Coloring Problems , 2007 .

[14]  Vijay V. Raghavan,et al.  Itemset Trees for Targeted Association Querying , 2003, IEEE Trans. Knowl. Data Eng..

[15]  Dietmar Jannach,et al.  Neighborhood-restricted mining and weighted application of association rules for recommenders , 2010, ITWP@UMAP.

[16]  Keun Ho Ryu,et al.  Mining association rules on significant rare data using relative support , 2003, J. Syst. Softw..

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