Name
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
2019 | 10.1016/j.ijar.2018.12.012 | International Journal of Approximate Reasoning |
Keywords | Field | DocType |
Probabilistic logic programming,Expectation-Maximization algorithm,Rule learning | Structure learning,Maximum likelihood,Theoretical computer science,Artificial intelligence,Probabilistic logic,Mathematics,Machine learning | Journal |
Volume | Issue | ISSN |
106 | 1 | 0888-613X |
Citations | PageRank | References |
0 | 0.34 | 22 |
Authors | ||
5 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Francisco H. O. V. de Faria | 1 | 0 | 0.34 |
| Arthur Colombini Gusmão | 2 | 0 | 0.34 |
| Glauber de Bona | 3 | 31 | 6.59 |
| Denis Deratani Mauá | 4 | 165 | 24.64 |
| Fábio G. Cozman | 5 | 26 | 3.45 |