Abstract
Extracting interesting rules from databases is an important field of knowledge discovery. Typically, enormous number of rules are embedded in a database and one of the essential abilities of discovery systems is to evaluate interestingness of rules to filter out less interesting rules. This paper proposes a new criterion of rule’s interestingness based on its exceptionality. This criterion evaluates exceptionality of rules by comparing their accuracy with those of simpler and more general rules. We also propose a disovery algorithm, DIG, to extract interesting rules with respect to the criterion effectively.
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
Agrawal, R., Mannila, H., Srikant, R. Toivonen, H. and Verkamo, A. I.: Fast Discovery of Association Rules. In Advances in Knowledge Discovery and Data Mining, ed. Fayyad, U. M. et al., AAAI Press (1996) 307–328.
Blake, C, Keogh, E. and Merz, C. J.: UCI Repository of machine learning databases. http://www.ics.uci.edu/mlearn/MLRepository.html (1999).
Fayyad, U. M. and Irani, K. B.: Multi-Interval Discretization of Continuous-Valued Attributes for Classification Learning. In Proceedings of the Thirteenth International Joint Conference on Artificial Intelligence(IJCAI-93), AAAI Press (1993) 1022–1027.
Guyon, I., Matic, N. and Vapnik, V.: Discovering Informative Patterns and Data Cleaning. In Advances in Knowledge Discovery and Data Mining, ed. Fayyad, U. M. et al., AAAI Press (1996) 181–203.
Kamber, M. and Shinghal, R. Evaluating the Interestingness of Characteristic Rules. In Proceedings of the Second International Conference on Knowledge Discovery and Data Mining(KDD-96). AAAI Press (1996) 263–266.
Piatetsky-Shapiro, G.: Discovery, Analysis and Presentation of Strong Rules. In Knowledge Discovery in Databases, ed. Piatetsky-Shapiro, G. and Frawley, W. J., AAAI Press (1991) 229–248.
Quinlan, J. R.: C4.5: Programs for Machine Learning. Morgan Kaufmann Publishers (1993).
Silverschatz, A. and Tuzhilin, A.: What Makes Patterns Interesting in Knowledge Dsicovery Systems. IEEE Transactions on Knowledge and Data Engineering Vol.8, No.6 (1996), 970–974.
Smyth, P. and Goodman, R. M.: Rule Induction Using Information Theory. In Knowledge Discovery in Databases, ed. Piatetsky-Shapiro, G. and Frawley, W. J., AAAI Press (1991) 160–176.
Suzuki, E.: Autonomous Discovery of Reliable Exception Rules. In Proceedings: The third International Conference on Knowledge Discovery and Data Mining(KDD-97), AAAI Press (1997) 259–262.
Srikant, R., Vu, Q. and Agrawal, R.: Mining Association Rules with Item Constraints. In Proceedings: The third International Conference on Knowledge Discovery and Data Mining(KDD-97), AAAI Press (1997) 67–73.
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
Yugami, N., Ohta, Y., Okamoto, S. (2000). Fast Discovery of Interesting Rules. 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_5
Download citation
DOI: https://doi.org/10.1007/3-540-45571-X_5
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