Skip to main content
SpringerLink
Log in

Searching the Subsumption Lattice by a Genetic Algorithm

  • Conference paper
  • First Online:
Inductive Logic Programming (ILP 2000)

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

Included in the following conference series:

Abstract

A framework for combining Genetic Algorithms with ILP methods is introduced and a novel binary representation and relevant genetic operators are discussed. It is shown that the proposed representation encodes a subsumption lattice in a complete and compact way. It is also shown that the proposed genetic operators are meaningful and can be interpreted in ILP terms such as lgg(least general generalization) and mgi(most general instance). These operators can be used to explore a subsumption lattice efficiently by doing binary operations (e.g. and/or). An implementation of the proposed framework is used to combine Inverse Entailment of CProgol with a genetic search.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. L. Badea and M. Stanciu. Refinement operators can be (weakly) perfect. In S. Džeroski and P. Flach, editors, Proceedings of the 9th International Workshop on Inductive Logic Programming, volume 1634 of Lecture Notes in Artificial Intelligence, pages 21–32. Springer-Verlag, 1999.

    Google Scholar 

  2. A. Giordana and F. Neri. Search-intensive concept induction. Evolutionary Computation Journal, 3(4):375–416, 1996.

    Article  Google Scholar 

  3. A. Giordana and C. Sale. Learning structured concepts using genetic algorithms. In D. Sleeman and P. Edwards, editors, Proceedings of the 9th International Workshop on Machine Learning, pages 169–178. Morgan Kaufmann, 1992.

    Google Scholar 

  4. D. E. Goldberg. Genetic Algorithms in Search, Optimization and Machine Learning. Addison Wesley, Reading, MA, 1989.

    MATH  Google Scholar 

  5. J. Hekanaho. Dogma: A ga-based relational learner. In D. Page, editor, Proceedings of the 8th International Conference on Inductive Logic Programming, volume 1446 of Lecture Notes in Artificial Intelligence, pages 205–214. Springer-Verlag, 1998.

    Google Scholar 

  6. J.H. Holland. Adaption in Natural and Artificial Systems. University of Michigan Press, Ann Arbor, Michigan, 1975.

    MATH  Google Scholar 

  7. Claire J. Kennedy and Christophe Giraud-Carrier. An evolutionary approach to concept learning with structured data. In Proceedings of the fourth International Conference on Artificial Neural Networks and Genetic Algorithms, pages 1–6. Springer Verlag, April1999.

    Google Scholar 

  8. Y. Kodratoff and R. Michalski. Research in machine learning: Recent progress, classification of methods and future directions. In Y. Kodratoff and R. Michalski, editors, Machine learning: an artificial intelligence approach, volume 3, pages 3–30. Morgan Kaufman, San Mateo, CA, 1990.

    Google Scholar 

  9. J. R. Koza. Genetic Programming. MIT Press, Cambridge,MA, 1991.

    Google Scholar 

  10. K. S. Leung and M. L. Wong. Genetic logic programming and applications. IEEE Expert, 10(5):68–76, 1995.

    Article  Google Scholar 

  11. R.S. Michalski. Pattern recognition as rule-guided inductive inference. In Proceedings of IEEE Transactions on Pattern Analysis and Machine Intelligence, pages 349–361, 1980.

    Google Scholar 

  12. S. Muggleton. Inductive logic programming. New Generation Computing, 8(4):295–318, 1991.

    Article  MATH  Google Scholar 

  13. S. Muggleton. Inverse entailment and Progol. New Generation Computing, 13:245–286, 1995.

    Google Scholar 

  14. S-H. Nienhuys-Cheng and R. de Wolf. Foundations of Inductive Logic Programming. Springer-Verlag, Berlin, 1997. LNAI 1228.

    Google Scholar 

  15. G.D. Plotkin. A note on inductive generalisation. In B. Meltzer and D. Michie, editors, Machine Intelligence 5, pages 153–163. Edinburgh University Press, Edinburgh, 1969.

    Google Scholar 

  16. A. Varšek. Inductive Logic Programming with Genetic Algorithms. PhD thesis, Faculty of Electrical Engineering and Computer Science, University of Ljubljana, Ljubljana, Slovenia, 1993. (In Slovenian).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of York, York, YO1, 5DD, UK

    Alireza Tamaddoni-Nezhad & Stephen H. Muggleton

Authors
  1. Alireza Tamaddoni-Nezhad
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Stephen H. Muggleton
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, University of York, Heslington, York, YO10 5DD, UK

    James Cussens  & Alan Frisch  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Tamaddoni-Nezhad, A., Muggleton, S.H. (2000). Searching the Subsumption Lattice by a Genetic Algorithm. In: Cussens, J., Frisch, A. (eds) Inductive Logic Programming. ILP 2000. Lecture Notes in Computer Science(), vol 1866. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44960-4_15

Download citation

  • DOI: https://doi.org/10.1007/3-540-44960-4_15

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-67795-6

  • Online ISBN: 978-3-540-44960-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation