A Novel Utility Sentient Approach for Mining Interesting Association Rules

Utility-based data mining is a new research area that concentrates on all types of utility factors in data mining processes and is targeted at incorporating utility considerations in both predictive and descriptive data mining tasks. Discovering interesting association rules that are utilized to improve the business utility of an enterprise has long been recognized in data mining community. This necessitates identifying interesting association patterns that are both statistically and semantically important to the business utility. Classical association rule mining techniques are capable of identifying interesting association patterns but they have failed to associate the user's objective and utility in mining. In this paper, we have proposed an approach for mining novel interesting association patterns from transaction data items of an enterprise to improve its business utility. The approach mines novel interesting association patterns by providing importance to significance, utility and subjective interestingness of the users. The novel interesting patterns mined using proposed approach can be used to provide valuable suggestions to the enterprise to improve its business.

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

[2]  William Frawley,et al.  Knowledge Discovery in Databases , 1991 .

[3]  Christos Tjortjis,et al.  Experiences of Using a Quantitative Approach for Mining Association Rules , 2003, IDEAL.

[4]  Frans Coenen,et al.  Finding Association Rules with Some Very Frequent Attributes , 2002, PKDD.

[5]  Dimitris Kanellopoulos,et al.  Association Rules Mining: A Recent Overview , 2006 .

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

[7]  Keshri Verma,et al.  Temporal Approach to Association Rule Mining Using T-Tree and P-Tree , 2005, MLDM.

[8]  Philip S. Yu,et al.  Mining Large Itemsets for Association Rules , 1998, IEEE Data Eng. Bull..

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

[10]  Kaizhong Zhang,et al.  Combinatorial pattern discovery for scientific data: some preliminary results , 1994, SIGMOD '94.

[11]  Chuan Wang,et al.  PRICES: An Efficient Algorithm for Mining Association Rules , 2004, IDEAL.

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

[13]  Gregory Piatetsky-Shapiro,et al.  Knowledge Discovery in Databases: An Overview , 1992, AI Mag..

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

[15]  Yubo Yuan,et al.  A Matrix Algorithm for Mining Association Rules , 2005, ICIC.

[16]  Ming-Syan Chen,et al.  Progressive Partition Miner: An Efficient Algorithm for Mining General Temporal Association Rules , 2003, IEEE Trans. Knowl. Data Eng..

[17]  Chin-Chen Chang,et al.  Two-Phase Algorithms for a Novel Utility-Frequent Mining Model , 2007, PAKDD Workshops.

[18]  Bianca Zadrozny,et al.  UBDM 2006: Utility-Based Data Mining 2006 workshop report , 2006, SKDD.

[19]  Ferenc Bodon,et al.  A fast APRIORI implementation , 2003, FIMI.

[20]  Girish Keshav Palshikar,et al.  Association Rules Mining Using Heavy Itemsets , 2005, COMAD.

[21]  Frans Coenen,et al.  Optimising Association Rule Algorithms Using Itemset Ordering , 2002 .