Scalable Model for Mining Critical Least Association Rules

A research in mining least association rules is still outstanding and thus requiring more attentions. Until now; only few algorithms and techniques are developed to mine the significant least association rules. In addition, mining such rules always suffered from the high computational costs, complicated and required dedicated measurement. Therefore, this paper proposed a scalable model called Critical Least Association Rule (CLAR) to discover the significant and critical least association rules. Experiments with a real and UCI datasets show that the CLAR can generate the critical least association rules, up to 1.5 times faster and less 100% complexity than benchmarked FP-Growth.

[1]  David J. Evans,et al.  Association rules on significant rare data using second support , 2006, Int. J. Comput. Math..

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

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

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

[5]  Ke Wang,et al.  Pushing Support Constraints Into Association Rules Mining , 2003, IEEE Trans. Knowl. Data Eng..

[6]  A. Tamilarasi,et al.  Mining Association rules with Dynamic and Collective Support Thresholds , 2009 .

[7]  Philip S. Yu,et al.  An effective hash-based algorithm for mining association rules , 1995, SIGMOD '95.

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

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

[10]  Mustafa Mat Deris,et al.  Mining Significant Least Association Rules Using Fast SLP-Growth Algorithm , 2010, AST/UCMA/ISA/ACN.

[11]  Ling Zhou,et al.  Association rule and quantitative association rule mining among infrequent items , 2007, MDM '07.

[12]  Stephen S.-T. Yau,et al.  Efficient association rule mining among infrequent items , 2005 .

[13]  Hojjat Adeli,et al.  Advances in Computer Science and Information Technology, AST/UCMA/ISA/ACN 2010 Conferences, Miyazaki, Japan, June 23-25, 2010. Joint Proceedings , 2010, AST/UCMA/ISA/ACN.

[14]  Tomasz Imielinski,et al.  Database Mining: A Performance Perspective , 1993, IEEE Trans. Knowl. Data Eng..

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