Abstract
This paper presents a method for mining exception rules based on a novel measure which estimates interestingness relative to its corresponding common sense rule and reference rule. Mining interesting rules is one of the important data mining tasks. Interesting rules bring novel knowledge that helps decision makers for advantageous actions. It is true that interestingness is a relative issue that depends on the other prior knowledge. However, this estimation can be biased due to the incomplete or inaccurate knowledge about the domain. Even if possible to estimate interestingness, it is not so trivial to judge the interestingness from a huge set of mined rules. Therefore, an automated system is required that can exploit the knowledge extractacted from the data in measuring interestingness. Since the extracted knowledge comes from the data, so it is possible to find a measure that is unbiased from the user’s own belief. An unbiased measure that can estimate the interestingness of a rule with respect to the extractacted rules can be more acceptable to the user. In this work we try to show through the experiments, how our proposed relative measure can give an unbiased estimate of relative interestingness in a rule considering already mined rules.
This author’s work is partially supported by a grant from the National 973 project of China (No. G1998030414)
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
R. Agrawal and R. Srikant. Fast algorithms for mining association rules. In Proc. 20th conference on Very Large Databases (VLDB), pages 478–499, 1994.
G. Piatetsky-Shapiro C. Matheus and D. McNeil. Selecting and Reporting What is Interesting: The KEFIR Application to Healthcare Data. AAAI Press/ MIT Press, 1996.
Sarawagi Chakrabarti. Mining surprising patterns using temporal description length. In Proc. 24th on Very Large Databases (VLDB), pages 606–616, 1998.
Liu H. and Lu H. Efficient search of reliable exceptions. In Proc. third Pacific-Asia conference on Knowledge Discovery and Data mining (PAKDD), pages 194–203, 1999.
W. Hsu Liu B. and Shu Chen. Using general impression to analyze discovered classification rules. In Proc. third international conference on Knowledge Discovery and Data mining (KDD), pages 31–36, 1997.
H. Mannila M. Klemettinen. Finding interesting rules from large sets of discovered association rules. In Third Intl. Conference on Information and Knowledge Management (CIKM), 1994.
C.J. Merz and P.M. Murphy. UCI repository of machine learning databases. http://www.ics.uci.edu/~mlearn/MLRepository.html. Irvine, CA: University of California, Department of Information and Computer Science, 1996.
B. Padmanabhan and A. Tuzhilin. A beleif-driven method for discovering unexpected patterns. In Proc. fourth international conference on Knowledge Discovery and Data mining (KDD), pages 27–31, 1998.
C. Shannon and W. Weaver. The Mathematical Theory of Information. Urbana: University of Illinois Press, 1949.
P. Smyth and Goodman R. M. Rule induction using information theory. In Knowledge Discovery in Databases, Piatetsky-Shapiro, G. AAAI Press / The MIT Pres, pages 159–176, 1991.
E. Suzuki. Discovering unexpected exceptions: A stochastic approach. In Proc. RFID, pages 225–232, 1996.
E. Suzuki. Autonomous discovery of reliable exception rules. In Proc. third international conference on Knowledge Discovery and Data mining (KDD), pages 259–262, 1997.
E. Suzuki and Y. Kodratoff. Discovery of surprising exception rules based on intensity of implication. In Proc. second Pacific-Asia conference on Knowledge Discovery and Data mining (PAKDD), 1998.
E. Suzuki and M. Shimura. Exceptional knowledge discovery in databases based on information theory. In Proc. second international conference on Knowledge Discovery and Data mining (KDD), pages 295–298, 1996.
C. Thomas M and J. Thomas A. Elements of Information Theory. Wiley-Interscience Publication, 1996.
A. Tuzhilin and A. Silberschatz. What makes patterns interesting in knowledge discovery systems. In IEEE Trans. Knowledge Discovery and Data Engineering, pages 970–974, 1996.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hussain, F., Liu, H., Suzuki, E., Lu, H. (2000). Exception Rule Mining with a Relative Interestingness Measure. In: Terano, T., Liu, H., Chen, A.L.P. (eds) Knowledge Discovery and Data Mining. Current Issues and New Applications. PAKDD 2000. Lecture Notes in Computer Science(), vol 1805. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45571-X_11
Download citation
DOI: https://doi.org/10.1007/3-540-45571-X_11
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67382-8
Online ISBN: 978-3-540-45571-4
eBook Packages: Springer Book Archive