.png){kind=icon}
.png){kind=icon}
Return
Speeding up parameter and rule learning for acyclic probabilistic logic programs
.png){kind=icon}
OA
AI
DOI：10.1016/j.ijar.2018.12.012.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This paper introduces techniques that speed-up parameter and rule learning for acyclic probabilistic logic programs. We focus on maximum likelihood estimation of parameters, and show that significant improvements can be obtained by efficiently handling probabilistic rules. We then move to structure learning, where we learn sets of rules, by introducing an algorithm that greatly simplifies exact score-based learning. Experiments demonstrate that our methods can produce orders of magnitude speed-ups over the state-of-art in parameter and rule learning. (C) 2018 Elsevier Inc. All rights reserved.
Keywords:
Probabilistic logic programming
Expectation-Maximization algorithm
Rule 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:
2.9K
Citations:
5.1K