Relative Measure for Mining Interesting Rules

This paper presents a measure which estimates interestingness of a rule relative to its corresponding common sense rules. Mining interesting rules is one of the important data mining tasks. Interesting rules bring novel knowledge that helps decision makers for advantageous actions. Interestingness is a relative issue. It is relative with what is known about the domain. A measure which can estimate the interestingness of a rule relative to the known knowledge is thus required. However, this estimation may not be accurate due to the incomplete or inaccurate knowledge about the domain. Even if it is possible to estimate interestingness, it is not so trivial to judge the interestingness from a huge set of mined rules manually. Therefore, an automated system is required that can exploit the common sense rules extracted from the data to estimate interestingness. Since the common sense rules extracted from the data can represent the true nature about the domain, it is possible to nd an interestingness measure that is free from user's biased belief. A measure that can estimate the interestingness of a rule with respect to the extracted common sense rules can be more acceptable to the user. In this work we try to show through the experiments, how our proposed relative measure can estimate relative interestingness in a rule considering already mined rules.

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

[2]  Padhraic Smyth,et al.  An Information Theoretic Approach to Rule Induction from Databases , 1992, IEEE Trans. Knowl. Data Eng..

[3]  Wynne Hsu,et al.  Post-Analysis of Learned Rules , 1996, AAAI/IAAI, Vol. 1.

[4]  Hongjun Lu,et al.  Exception Rule Mining with a Relative Interestingness Measure , 2000, PAKDD.

[5]  Masamichi Shimura,et al.  Exceptional Knowledge Discovery in Databases Based on Information Theory , 1996, KDD.

[6]  Thomas M. Cover,et al.  Elements of Information Theory , 2005 .

[7]  Gregory Piatetsky-Shapiro,et al.  The interestingness of deviations , 1994 .

[8]  Gregory Piatetsky-Shapiro,et al.  Selecting and reporting What Is Interesting , 1996, Advances in Knowledge Discovery and Data Mining.

[9]  Einoshin Suzuki,et al.  Discovery of Surprising Exception Rules Based on Intensity of Implication , 1998, PKDD.

[10]  Heikki Mannila,et al.  Finding interesting rules from large sets of discovered association rules , 1994, CIKM '94.

[11]  R. Agarwal.  Fast Algorithms for Mining Association Rules , 1994, VLDB 1994.

[12]  Roberto J. Bayardo,et al.  Mining the most interesting rules , 1999, KDD '99.

[13]  Wynne Hsu,et al.  Tuple-Level Analysis for Identification of Interesting Patterns , 1996 .

[14]  Catherine Blake,et al.  UCI Repository of machine learning databases , 1998 .

[15]  Wynne Hsu,et al.  Using General Impressions to Analyze Discovered Classification Rules , 1997, KDD.

[16]  Balaji Padmanabhan,et al.  A Belief-Driven Method for Discovering Unexpected Patterns , 1998, KDD.

[17]  Einoshin Suzuki,et al.  Autonomous Discovery of Reliable Exception Rules , 1997, KDD.

[18]  Ling Feng,et al.  Eecient Search of Reliable Exceptions , 1999 .

[19]  Ke Wang,et al.  Visually Aided Exploration of Interesting Association Rules , 1999, PAKDD.