Skip to main content

Automating the ILP Setup Task: Converting User Advice about Specific Examples into General Background Knowledge

  • Conference paper
Inductive Logic Programming (ILP 2010)

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

Included in the following conference series:

Abstract

Inductive Logic Programming (ILP) provides an effective method of learning logical theories given a set of positive examples, a set of negative examples, a corpus of background knowledge, and specification of a search space (e.g., via mode definitions) from which to compose the theories. While specifying positive and negative examples is relatively straightforward, composing effective background knowledge and search-space definition requires detailed understanding of many aspects of the ILP process and limits the usability of ILP. We introduce two techniques to automate the use of ILP for a non-ILP expert. These techniques include automatic generation of background knowledge from user-supplied information in the form of a simple relevance language, used to describe important aspects of specific training examples, and an iterative-deepening-style search process.

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

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Alphonse, E., Matwin, S.: Feature subset selection and inductive logic programming. In: Proceedings of the 19th Intl. Conf. on Machine Learning, pp. 11–18 (2002)

    Google Scholar 

  2. De Raedt, L.: Interactive Theory Revision: An Inductive Logic Programming Approach. Academic Press, London (1992)

    Google Scholar 

  3. Finn, P., Muggleton, S., Page, D., Srinivasan, A.: Discovery of pharmacophores using the inductive logic programming system Progol. Machine Learning 30, 241–270 (1998)

    Article  Google Scholar 

  4. Getoor, L., Taskar, B. (eds.): Introduction to Statistical Relational Learning. MIT Press, Cambridge (2007)

    MATH  Google Scholar 

  5. Kohavi, R., John, G.: Automatic parameter selection by minimizing estimated error. In: Proceedings of the 12th International Conf. on Machine Learning, pp. 304–312 (1995)

    Google Scholar 

  6. Lavrac, N., Gamberger, D., Jovanosk, V.: A study of relevance for learning in deductive databases. Journal of Logic Programming 40, 215–249 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  7. Mangasarian, O., Shavlik, J., Wild, E.: Knowledge-based kernel approximation. Journal of Machine Learning Research 5, 1127–1141 (2004)

    MathSciNet  Google Scholar 

  8. Mozina, M., Zabkar, J., Bratko, I.: Argument based machine learning. Artificial Intelligence 171, 922–937 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  9. Muggleton, S., Buntine, W.: Machine invention of first-order predicates by inverting resolution. In: Proceedings of the 5th Intl. Conf. on Machine Learning, pp. 339–352 (1988)

    Google Scholar 

  10. Muggleton, S.: DUCE, an oracle based approach to constructive induction. In: Proceedings of the International Joint Conf. on Artificial Intelligence, pp. 287–292 (1987)

    Google Scholar 

  11. Muggleton, S.: Inverse entailment and Progol. New Generation Comp. 13, 245–286 (1995)

    Article  Google Scholar 

  12. Oblinger, D.: Bootstrap learning - external materials (2006), http://www.sainc.com/bl-extmat

  13. Pazzani, M., Kibler, D.: The utility of knowledge in inductive learning. Machine Learning 9, 57–94 (1992)

    Google Scholar 

  14. Richards, B., Mooney, R.: Automated refinement of first-order Horn-clause domain theories. Machine Learning 19, 95–131 (1995)

    Google Scholar 

  15. Sammut, C.: Learning Concepts by Performing Experiments. Ph.D. Dissertation, Department of Computer Science, University of New South Wales (1981)

    Google Scholar 

  16. Shapiro, E.Y.: Algorithmic Program Debugging. MIT Press, Cambridge (1983)

    Google Scholar 

  17. Srinivasan, A., King, R.D., Bain, M.E.: An empirical study of the use of relevance information in inductive logic programming. JMLR 4, 369–383 (2003)

    Article  MathSciNet  Google Scholar 

  18. Srinivasan, A., Muggleton, S., King, R.: Comparing the use of background knowledge by inductive logic programming systems. In: Proc. 5th ILP Workshop (1995)

    Google Scholar 

  19. Srinivasan, A.: The Aleph Manual, http://www.comlab.ox.ac.uk/activities/machinelearning/Aleph/aleph.html

  20. Towell, G., Shavlik, J.: Knowledge-based artificial neural networks. Artificial Intelligence 70, 119–165 (1994)

    Article  MATH  Google Scholar 

  21. Walker, T.: Broadening the Applicability of Relational Learning. Ph.D. Dissertation, Computer Sciences Department, University of Wisconsin – Madison (forthcoming, 2011)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Walker, T. et al. (2011). Automating the ILP Setup Task: Converting User Advice about Specific Examples into General Background Knowledge. In: Frasconi, P., Lisi, F.A. (eds) Inductive Logic Programming. ILP 2010. Lecture Notes in Computer Science(), vol 6489. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-21295-6_28

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-21295-6_28

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-21294-9

  • Online ISBN: 978-3-642-21295-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics