[go: up one dir, main page]
More Web Proxy on the site http://driver.im/
Skip to main content

λ-Subsumption and its application to learning from positive-only examples

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

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

Included in the following conference series:

  • 131 Accesses

Abstract

The general aim of the present paper is to show the advantages of the model-theoretic approach to Inductive Logic Programming. The paper introduces a new generality ordering between Horn clauses, called λ-subsumption. It is stronger than B-subsumption and weaker than generalized subsumption. Most importantly λ-subsumption allows to compare clauses in a local sense, i.e. with respect to a partial interpretation. This allows to define a non-trivial upper bound in the λ-subsumption lattice without the use of negative examples. An algorithm for concept learning from positive-only examples, based on these ideas, is described and its performance is empirically evaluated in the paper.

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

Access this chapter

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. Bergadano, F., Gunetti, D.: Functional Inductive Logic Programming with Queries to the User. In Proceedings of ECML-93, LNAI, Vo1.667, Springer-Verlag, 1993, 323–328.

    Google Scholar 

  2. Buntine, W.: Generalized Subsumption and Its Application to Induction and Redundancy, Artificial Intelligence, Vol. 36 (1988), 149–176.

    Google Scholar 

  3. Conklin, D., Witten, I.: Complexity-Based Induction, Machine Learning, Vol. 16 (3), 1994, 203–225.

    Google Scholar 

  4. De Raedt, L., Lavrac, N., Dzeroski, S.: Multiple Predicate Learning. In: Proceedings of IJCAI-93, Chambery, France, August 28-September 3, 1993, 1037–1042.

    Google Scholar 

  5. Gold, E.M.: Language Identification in the Limit. Information and Control, Vol. 10, 1967, 447–474.

    Google Scholar 

  6. Ling, C.X.: Logic Program Synthesis from Good Examples. In S. Muggleton (ed.), Inductive Logic Programming, Academic Press, 1992, 113–129.

    Google Scholar 

  7. Markov, Z.: Relational Learning by Heuristic Evaluation of Ground Data. In S. Wrobel (Ed.), Proceedings of Fourth Int. Workshop on ILP (ILP-94), September 12–14, 1994, Bad Honnef/Bon, Germany, GMD-Studien Nr.237, 337–349.

    Google Scholar 

  8. Markov, Z.: A Functional Approach to ILP. In Luc De Raedt (Ed.), Proceedings of the Fifth Int. Workshop on ILP (ILP-95), 4–6 Sept. 1995, Leuven, Scientific report, Department of Computer Science, K.U. Leuven, September, 1995, 267–280.

    Google Scholar 

  9. Muggleton, S., Buntine, W.: Machine invention of first-order predicates by inverting resolution. In Proceedings of the Fifth Int. Conference on Machine Learning, Morgan Kaufmann, 1988, 339–352.

    Google Scholar 

  10. Muggleton, S., Feng, C.: Efficient induction of logic programs. In S. Muggleton (ed.), Inductive Logic Programming, Academic Press, 1992, 281–298.

    Google Scholar 

  11. Muggleton, S., Srinivasan, A., Bain, M.: Compression, significance and accuracy. In D. Sleeman, P. Edwards (eds.), Proceedings of the Ninth Int. Conference of Machine Learning (ML92), Morgan Kaufmann, 1992, 338–347.

    Google Scholar 

  12. Muggleton, S., Page, C.D.: Self-saturation of definite clauses. In S. Wrobel (Ed.), Proceedings of Fourth Int. Workshop on ILP (ILP'94), September 12–14, 1994, Bad Honnef/Bon, Germany, GMD-Studien Nr.237, 161–174.

    Google Scholar 

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

    Google Scholar 

  14. Quinlan, J.R.: Learning logical definitions from relations. Machine Learning, 5 (1990), 239–266.

    Google Scholar 

  15. Ramsay, A.: Formal Methods in Artificial Intelligence, Cambridge University Press, 1991.

    Google Scholar 

  16. Rouveirol, S.: Extensions of Inversion of Resolution Applied to Theory Completion. In S. Muggleton (ed.), Inductive Logic Programming, Academic Press, 1992, 63–92.

    Google Scholar 

  17. Stahl, I., Tausend, B., Wirth, R.: Two Methods for Improving Inductive Logic Programming Systems. In Proceedings of ECML-93, LNAI, Vol.667, Springer-Verlag, 1993, 41–55.

    Google Scholar 

  18. Zelle, J., Thompson, C., Califf, M., Mooney, R.: Inducing Logic Programs without Explicit Negative Examples. In Luc De Raedt (Ed.), Proceedings of the Fifth Int. Workshop on ILP (ILP-95), 4–6 Sept. 1995, Leuven, Scientific report, Department of Computer Science, K.U. Leuven, September, 1995, 403–416.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Stephen Muggleton

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Markov, Z. (1997). λ-Subsumption and its application to learning from positive-only examples. In: Muggleton, S. (eds) Inductive Logic Programming. ILP 1996. Lecture Notes in Computer Science, vol 1314. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-63494-0_66

Download citation

  • DOI: https://doi.org/10.1007/3-540-63494-0_66

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-63494-2

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics