.png){kind=icon}
返回
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}
分享.png){kind=icon}
收藏
摘要
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.
Keyword:
Probabilistic logic programming
Expectation-Maximization algorithm
Rule learning
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。