Interestingness Measures for Multi-Level Association Rules

Association rule mining is one technique that is widely used when querying databases, especially those that are transactional, in order to obtain useful associations or correlations among sets of items. Much work has been done focusing on efficiency, effectiveness and redundancy. There has also been a focusing on the quality of rules from single level datasets with many interestingness measures proposed. However, with multi-level datasets now being common there is a lack of interestingness measures developed for multi-level and cross-level rules. Single level measures do not take into account the hierarchy found in a multi-level dataset. This leaves the Support-Confidence approach, which does not consider the hierarchy anyway and has other drawbacks, as one of the few measures available. In this chapter we propose two approaches which measure multi-level association rules to help evaluate their interestingness by considering the database’s underlying taxonomy. These measures of diversity and peculiarity can be used to help identify those rules from multi-level datasets that are potentially useful.

[1]  Ee-Peng Lim,et al.  Mining Multi-Level Rules with Recurrent Items using FP'-Tree , 2001 .

[2]  Patrick Meyer,et al.  Association Rule Interestingness Measures: Experimental and Theoretical Studies , 2007, Quality Measures in Data Mining.

[3]  Abraham Silberschatz,et al.  What Makes Patterns Interesting in Knowledge Discovery Systems , 1996, IEEE Trans. Knowl. Data Eng..

[4]  A Richard,et al.  DIVERSITY-BASED INTERESTINGNESS MEASURES FOR ASSOCIATION RULE MINING , 2009 .

[5]  Olivier Teytaud,et al.  Association Rule Interestingness: Measure and Statistical Validation , 2007, Quality Measures in Data Mining.

[6]  Yue Xu,et al.  Extracting Non-redundant Approximate Rules from Multi-level Datasets , 2008, 2008 20th IEEE International Conference on Tools with Artificial Intelligence.

[7]  Sean M. McNee,et al.  Improving recommendation lists through topic diversification , 2005, WWW '05.

[8]  Ning Zhong,et al.  Peculiarity Oriented Mining and Its Application for Knowledge Discovery in Amino-Acid Data , 2001, PAKDD.

[9]  Yue Xu,et al.  Using Association Rules to Solve the Cold-Start Problem in Recommender Systems , 2010, PAKDD.

[10]  Jiawei Han,et al.  Mining Multiple-Level Association Rules in Large Databases , 1999, IEEE Trans. Knowl. Data Eng..

[11]  Howard J. Hamilton,et al.  Interestingness measures for data mining: A survey , 2006, CSUR.

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

[13]  Jiawei Han,et al.  Discovery of Multiple-Level Association Rules from Large Databases , 1995, VLDB.

[14]  Yue Xu,et al.  Concise representations for approximate association rules , 2008, 2008 IEEE International Conference on Systems, Man and Cybernetics.

[15]  Xiaoping Fan,et al.  A New Interestingness Measure of Association Rules , 2008, 2008 Second International Conference on Genetic and Evolutionary Computing.

[16]  Wynne Hsu,et al.  Multi-level organization and summarization of the discovered rules , 2000, KDD '00.

[17]  Jiawei Han,et al.  Data Mining: Concepts and Techniques , 2000 .

[18]  Gerd Stumme,et al.  Generating a Condensed Representation for Association Rules , 2005, Journal of Intelligent Information Systems.

[19]  Kenneth McGarry,et al.  A survey of interestingness measures for knowledge discovery , 2005, The Knowledge Engineering Review.

[20]  Yiyu Yao,et al.  Peculiarity Oriented Multidatabase Mining , 2003, IEEE Trans. Knowl. Data Eng..

[21]  Lars Schmidt-Thieme,et al.  Taxonomy-driven computation of product recommendations , 2004, CIKM '04.

[22]  Jinyan Li,et al.  Interestingness of Discovered Association Rules in Terms of Neighborhood-Based Unexpectedness , 1998, PAKDD.

[23]  Raymond T. Ng,et al.  Distance-based outliers: algorithms and applications , 2000, The VLDB Journal.

[24]  Yue Xu,et al.  Eliminating Redundant Association Rules in Multi-Level Datasets , 2008, DMIN.

[25]  Yue Xu,et al.  Generating concise association rules , 2007, CIKM '07.

[26]  . R.C.Jain,et al.  Mining Level-Crossing Association Rules from Large Databases , 2006 .

[27]  Yiyu Yao,et al.  Peculiarity Analysis for Classifications , 2009, 2009 Ninth IEEE International Conference on Data Mining.

[28]  M. Anandhavalli,et al.  Interestingness Measure for Mining Spatial Gene Expression Data using Association Rule , 2010, ArXiv.

[29]  Jiawei Han,et al.  Mining knowledge at multiple concept levels , 1995, CIKM '95.

[30]  Yuefeng Li,et al.  Mining Non-Redundant Association Rules Based on Concise Bases , 2007, Int. J. Pattern Recognit. Artif. Intell..

[31]  Mohammed J. Zaki.  Mining Non-Redundant Association Rules , 2004, Data Min. Knowl. Discov..

[32]  Yue Xu,et al.  Deriving non-redundant approximate association rules from hierarchical datasets , 2008, CIKM '08.