.png){kind=icon}
Return
Learning failure-free PRISM programs
.png){kind=icon}
OA
AI
DOI：10.1016/j.ijar.2015.06.003.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
PRISM is a probabilistic logic programming formalism which allows defining a probability distribution over possible worlds. This paper investigates learning a class of generative PRISM programs known as failure-free. The aim is to learn recursive PRISM programs which can be used to model stochastic processes. These programs generalise dynamic Bayesian networks by defining a halting distribution over the generative process. Dynamic Bayesian networks model infinite stochastic processes. Sampling from infinite process can only be done by specifying the length of sequences that the process generates. In this case, only observations of a fixed length of sequences can be obtained. On the other hand, the recursive PRISM programs considered in this paper are self-terminating upon some halting conditions. Thus, they generate observations of different lengths of sequences. The direction taken by this paper is to combine ideas from inductive logic programming and learning Bayesian networks to learn PRISM programs. It builds upon the inductive logic programming approach of learning from entailment. (C) 2015 Elsevier Inc. All rights reserved.
Keywords:
Probabilistic inductive logic programming
Probabilistic logic
PRISM
Structure learning
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
3
Papers:
3.0K
Citations:
5.1K
Organization
Cited Papers
ShareSave
Module networks: identifying regulatory modules and their condition-specific regulators from gene expression data.png)
NATURE GENETICS
NATURE GENETICSIF31.8
PREAI
ShareSaveShareSaveEfficient approximations for the marginal likelihood of Bayesian networks with hidden variablesMACHINE LEARNINGOAAI
MACHINE LEARNINGIF2.9
OAAIShareSaveShareSaveShareSave
View more