Skip to main content

Argument-Based Machine Learning

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 4203))

Abstract

In this paper, some recent ideas will be presented about making machine learning (ML) more effective through mechanisms of argumentation. In this sense, argument-based machine learning (ABML) is defined as a refinement of the usual definition of ML. In ABML, some learning examples are accompanied by arguments, that are expert’s reasons for believing why these examples are as they are. Thus ABML provides a natural way of introducing domain-specific prior knowledge in a way that is different from the traditional, general background knowledge. The task of ABML is to find a theory that explains the “argumented” examples by making reference to the given reasons. ABML, so defined, is motivated by the following advantages in comparison with standard learning from examples: (1) arguments impose constraints over the space of possible hypotheses, thus reducing search complexity, and (2) induced theories should make more sense to the expert. Ways of realising ABML by extending some existing ML techniques are discussed, and the aforementioned advantages of ABML are demonstrated experimentally.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bratko, I.: Prolog Programming for Artificial Intelligence, 3rd edn. Pearson Education / Addison-Wesley (2001)

    Google Scholar 

  2. Bratko, I., Možina, M.: Argumentation and machine learning. Chapter 5 of Theoretical framework for argumentation, ASPIC project, deliverable D2.1 (2004)

    Google Scholar 

  3. Clark, P., Niblett, T.: The CN2 induction algorithm. MachineLearning Journal 4, 261–283 (1989)

    Google Scholar 

  4. Gomez, S.A., Chesnevar, C.I.: Integrating defeasible argumentation and machine learning techniques. Technical report, Universidad Nacional del Sur, Bahia Blanca (2004)

    Google Scholar 

  5. Možina, M., Demšar, J., Žabkar, J., Bratko, I.: Why is rule learning optimistic and how to correct it. In: Fürnkranz, J., Scheffer, T., Spiliopoulou, M. (eds.) ECML 2006. LNCS (LNAI), vol. 4212, pp. 330–340. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  6. Možina, M., Žabkar, J., Bench-Capon, T., Bratko, I.: Argument Based Machine Learning Applied to Law. Artificial Intelligence and Law (in press, 2006)

    Google Scholar 

  7. Možina, M., Žabkar, J., Bratko, I.: Argument based rule learning. In: ECAI 2006, Riva del Garda, Italy, Springer, Heidelberg (2006)

    Google Scholar 

  8. Možina, M., Žabkar, J., Videčnik, J., Bratko, I.: Argument based machine learning in a medical domain. In: Proc. COMMA 2006, Manchester (2006)

    Google Scholar 

  9. Prakken, H., Vreeswijk, G.: Handbook of Philosophical Logic. In: Logics for Defeasible Argumentation, 2nd edn., vol. 4, pp. 218–319. Kluwer Academic Publishers, Dordrecht (2002)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bratko, I., Možina, M., Žabkar, J. (2006). Argument-Based Machine Learning. In: Esposito, F., Raś, Z.W., Malerba, D., Semeraro, G. (eds) Foundations of Intelligent Systems. ISMIS 2006. Lecture Notes in Computer Science(), vol 4203. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11875604_2

Download citation

  • DOI: https://doi.org/10.1007/11875604_2

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-45764-0

  • Online ISBN: 978-3-540-45766-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics