Inductive Programming by Expectation Maximization Algorithm
نویسنده
چکیده
This paper proposes an algorithm which can write programs automatically to solve problems. We model the sequence of instructions as a n-gram language model and the sequence is represented by some hidden variables. Expectation maximization algorithm is applied to train the n-gram model and perform program induction. Our approach is very flexible and can be applied to many problems. In this paper, we will concentrate on function approximation and traveling salesperson problem.
منابع مشابه
LPMEME: A Statistical Method for Inductive Logic Programming
This paper describes LPMEME, a 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 statements 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 maxi...
متن کاملIn Proceedings of the Ai ' 96 Conference , Toronto , May 1996
This paper describes LPMEME, a new learning algorithm for inductive logic programming that uses statistical techniques to nd rst-order patterns. LPMEME takes as input examples in the form of logical facts and outputs a rst-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 maximizatio...
متن کامل"Say EM" for Selecting Probabilistic Models for Logical Sequences
Many real world sequences such as protein secondary structures or shell logs exhibit a rich internal structures. Traditional probabilistic models of sequences, however, consider sequences of flat symbols only. Logical hidden Markov models have been proposed as one solution. They deal with logical sequences, i.e., sequences over an alphabet of logical atoms. This comes at the expense of a more c...
متن کاملExperimentation of an expectation maximization algorithm for probabilistic logic programs
Statistical Relational Learning and Probabilistic Inductive Logic Programming are two emerging fields that use representation languages able to combine logic and probability. In the field of Logic Programming, the distribution semantics is one of the prominent approaches for representing uncertainty and underlies many languages such as ICL, PRISM, ProbLog and LPADs. Learning the parameters for ...
متن کاملLearning the Structure of Probabilistic Logic Programs
There is a growing interest in the field of Probabilistic Inductive Logic Programming, which uses languages that integrate logic programming and probability. Many of these languages are based on the distribution semantics and recently various authors have proposed systems for learning the parameters (PRISM, LeProbLog, LFI-ProbLog and EMBLEM) or both the structure and the parameters (SEM-CP-logi...
متن کامل