LPMEME: A statistical method for inductive logic programming

  • Karan Bhatia
  • Charles Elkan
Learning I: Induction
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1081)

Abstract

This paper describes LPMEME, a new learning algorithm for inductive logic programming that uses statistical techniques to find first-order patterns. LPMEME takes as input examples in the form of logical facts and outputs a first-order theory that is represented to some degree in all of the examples. LPMEME uses an underlying statistical model whose parameters are learned using expectation maximization, an iterative gradient descent method for maximum likelihood parameter estimation. The underlying statistical model is described and the EM algorithm developed. Experimental tests show that LPMEME can learn first-order concepts and can be used to find approximate solutions to the subgraph isomorphism problem.

Keywords

learning inductive logic programming maximum likelihood parameter estimation expectation maximization 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag 1996

Authors and Affiliations

  • Karan Bhatia
    • 1
  • Charles Elkan
    • 1
  1. 1.Department of Computer Science and Engineering 0114University of California, San DiegoLa Jolla

Personalised recommendations