Discovery of surprising exception rules based on intensity of implication

  • Einoshin Suzuki
  • Yves Kodratoff
Communications Session 1. Rule Evaluation
First Online:
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1510)

Abstract

This paper presents an algorithm for discovering surprising exception rules from data sets. An exception rule, which is defined as a deviational pattern to a common sense, exhibits unexpectedness and is sometimes extremely useful. A domain-independent approach, PEDRE, exists for the simultaneous discovery of exception rules and their common sense rules. However, PEDRE, being too conservative, have difficulty in discovering surprising rules. Historic exception discoveries show that surprise is often linked with interestingness. In order to formalize this notion we propose a novel approach by improving PEDRE. First, we reformalize the problem and settle a looser constraints on the reliability of an exception rule. Then, in order to screen out uninteresting rules, we introduce, for an exception rule, an evaluation criterion of surprise by modifying intensity of implication, which is based on significance. Our approach has been validated using data sets from the UCI repository.

Keywords

Seat Belt Strong Rule Rule Discovery Conjunction Rule Edibility Class 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Download to read the full conference paper text

References

  1. 1.
    Agrawal, R., Mannila, H., Srikant, R. et al.: Fast Discovery of Association Rules, Advances in Knowledge Discovery and Data Mining, AAAI Press/The MIT Press (1996) 307–328.Google Scholar
  2. 2.
    Fleury, L., Djeraba, C., Briand, H. and Philippé, J.: Rule Evaluations in a KDD System, Database and Expert Systems Applications, Springer-Verlag (1995) 405–414Google Scholar
  3. 3.
    Gras, R. and Lahrer, A.: L’Implication Statistique: une Nouvelle Methode d’Analyse de Données, Mathematiques, Informatique et Sciences Humaines, 120 (1993) 5–31.Google Scholar
  4. 4.
    Lerman, I. C., Gras, R. and Rostam, H.: Elaboration et Evaluation d’un Indice d’Implication pour Données Binaire, Mathematiques, Informatique et Sciences Humaines, 74 (1981) 5–35MATHGoogle Scholar
  5. 5.
    Merz, C. J. and Murphy, P. M.: UCI Repository of machine learning databases, http://www.ics.uci.edu/~mlearn/MLRepository.html, Univ. of California, Dept. of Information and Computer Sci. (1998)
  6. 6.
    Silberschatz, A. and Tuzhilin, A.: On Subjective Measures of Interestingness in Knowledge Discovery, Proc. of KDD-95 (1995) 275–281Google Scholar
  7. 7.
    Smyth, P. and Goodman, R. M.: An Information Theoretic Approach to Rule Induction from Databases, IEEE Trans. on Knowledge and Data Eng., 4 (4) (1992) 301–316CrossRefGoogle Scholar
  8. 8.
    Suzuki, E. and Shimura, M.: Exceptional Knowledge Discovery in Databases based on Information Theory, Proc. of KDD-96 (1996) 275–278Google Scholar
  9. 9.
    Suzuki, E.: Discovering Unexpected Exceptions: A Stochastic Approach, Proc. of RSFD-96 (1996) 225–232Google Scholar
  10. 10.
    Suzuki, E.: Autonomous Discovery of Reliable Exception Rules, Proc. of KDD-97 (1997) 259–262.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1998

Authors and Affiliations

  • Einoshin Suzuki
    • 1
  • Yves Kodratoff
    • 2
  1. 1.Electrical and Computer EngineeringYokohama National UniversityYokohamaJapan
  2. 2.Equipe Inference et ApprentisageUniversité de Paris-SudOrsay CedexFrance

Personalised recommendations