Advertisement

Analysing the Trade-Off Between Comprehensibility and Accuracy in Mimetic Models

  • Ricardo Blanco-Vega
  • José Hernández-Orallo
  • María José Ramírez-Quintana
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3245)

Abstract

One of the main drawbacks of many machine learning techniques, such as neural networks or ensemble methods, is the incomprehensibility of the model produced. One possible solution to this problem is to consider the learned model as an oracle and generate a new model that “mimics” the semantics of the oracle by expressing it in the form of rules. In this paper we analyse experimentally the influence of pruning, the size of the invented dataset and the confidence of the examples in order to obtain shorter sets of rules without reducing too much the accuracy of the model. The experiments show that the factors analysed affect the mimetic model in different ways. We also show that by combining these factors in a proper way the quality of the mimetic model improves significantly wrt. other previous reports on the mimetic method.

Keywords

Ensemble Method Repetition Factor Confidence Threshold Random Dataset Label Dataset 
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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Black, C.L., Merz, C.J.: UCI repository of machine learning databases (1998)Google Scholar
  2. 2.
    Domingos, P.: Knowledge Discovery Via Multiple Models. Intelligent Data Analysis 2(1-4), 187–202 (1998)CrossRefGoogle Scholar
  3. 3.
    Domingos, P.: Learning Multiple Models without Sacrificing Comprehen-sibility. In: Proc. of the 14th National Conf. on AI, p. 829 (1997)Google Scholar
  4. 4.
    Estruch, V., Ferri, C., Hernandez-Orallo, J., Ramirez-Quintana, M.J.: Simple Mimetic Classifiers. In: Perner, P., Rosenfeld, A. (eds.) MLDM 2003. LNCS, vol. 2734, pp. 156–171. Springer, Heidelberg (2003)CrossRefGoogle Scholar
  5. 5.
    Estruch, V., Hernández-Orallo, J.: Theoretical Issues of Mimetic Classifiers, TR DSIC (2003), http://www.dsic.upv.es/~flip/papers/mim.ps.gz
  6. 6.
    Provost, F., Domingos, P.: Tree induction for probability-based rankings. Machine Learning 52(3), 199–215 (2003)zbMATHCrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2004

Authors and Affiliations

  • Ricardo Blanco-Vega
    • 1
  • José Hernández-Orallo
    • 1
  • María José Ramírez-Quintana
    • 1
  1. 1.Departamento de Sistemas Informáticos y ComputaciónUniversidad Politécnica de ValenciaValenciaSpain

Personalised recommendations