Structure learning of probabilistic logic programs by searching the clause space
From MaRDI portal
Publication:4592977
Abstract: Learning probabilistic logic programming languages is receiving an increasing attention and systems are available for learning the parameters (PRISM, LeProbLog, LFI-ProbLog and EMBLEM) or both the structure and the parameters (SEM-CP-logic and SLIPCASE) of these languages. In this paper we present the algorithm SLIPCOVER for "Structure LearnIng of Probabilistic logic programs by searChing OVER the clause space". It performs a beam search in the space of probabilistic clauses and a greedy search in the space of theories, using the log likelihood of the data as the guiding heuristics. To estimate the log likelihood SLIPCOVER performs Expectation Maximization with EMBLEM. The algorithm has been tested on five real world datasets and compared with SLIPCASE, SEM-CP-logic, Aleph and two algorithms for learning Markov Logic Networks (Learning using Structural Motifs (LSM) and ALEPH++ExactL1). SLIPCOVER achieves higher areas under the precision-recall and ROC curves in most cases.
Recommendations
- scientific article; zbMATH DE number 1950779
- Lifted discriminative learning of probabilistic logic programs
- Bandit-based Monte-Carlo structure learning of probabilistic logic programs
- Closed-form solutions in learning probabilistic logic programs by exact score maximization
- Parameter estimation in stochastic logic programs
Cites work
- scientific article; zbMATH DE number 3694981 (Why is no real title available?)
- scientific article; zbMATH DE number 1753155 (Why is no real title available?)
- ALLPAD: approximate learning of logic programs with annotated disjunctions
- Applying the information bottleneck to statistical relational learning
- Approximate Inference for Logic Programs with Annotated Disjunctions
- CP-logic: A language of causal probabilistic events and its relation to logic programming
- Compressing probabilistic Prolog programs
- Discriminative Structure Learning of Markov Logic Networks
- Estimating the dimension of a model
- Extended semantics and inference for the Independent Choice Logic
- Inductive Logic Programming
- Inference with Logic Programs with Annotated Disjunctions under the Well Founded Semantics
- Learning ground GP-logic theories by leveraging Bayesian network learnng techniques
- Logic Programming
- Logic Programming
- Logic programming, abduction and probability. A top-down anytime algorithm for estimating prior and posterior probabilities
- Markov logic networks
- On the implementation of the probabilistic logic programming language ProbLog
- Probabilistic inductive logic programming. Theory and applications
- Probabilistic rule learning
- Relational learning with statistical predicate invention: Better models for hypertext
- SLGAD resolution for inference on logic programs with annotated disjunctions
- Tabling and answer subsumption for reasoning on logic programs with annotated disjunctions
- The PITA system: tabling and answer subsumption for reasoning under uncertainty
- The YAP prolog system
- The independent choice logic for modelling multiple agents under uncertainty
- The well-founded semantics for general logic programs
- Theory refinement combining analytical and empirical methods
- Well–definedness and efficient inference for probabilistic logic programming under the distribution semantics
Cited in
(22)- DKL: an efficient algorithm for learning deterministic Kripke structures
- Inductive logic programming at 30
- Speeding up parameter and rule learning for acyclic probabilistic logic programs
- Generalized ordering-search for learning directed probabilistic logical models
- Using SWISH to realize interactive web-based tutorials for logic-based languages
- Learning to rank the distinctiveness of behaviour in serial offending
- scientific article; zbMATH DE number 1950779 (Why is no real title available?)
- \(\alpha\)ILP: thinking visual scenes as differentiable logic programs
- Learning Effect Axioms via Probabilistic Logic Programming
- The complexity and generality of learning answer set programs
- Tableau reasoning for description logics and its extension to probabilities
- Optimizing probabilities in probabilistic logic programs
- Bandit-based Monte-Carlo structure learning of probabilistic logic programs
- Probabilistic inductive constraint logic
- Inductive general game playing
- Lifted discriminative learning of probabilistic logic programs
- Learning hierarchical probabilistic logic programs
- Abduction with probabilistic logic programming under the distribution semantics
- Learning probabilistic logic programs over continuous data
- Theory and Applications of Satisfiability Testing
- CHR(PRISM)-based probabilistic logic learning
- Gradient-based boosting for statistical relational learning: the Markov logic network and missing data cases
This page was built for publication: Structure learning of probabilistic logic programs by searching the clause space
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4592977)
