2019
DOI: 10.1016/j.ijar.2018.12.012
|View full text |Cite
|
Sign up to set email alerts
|

Speeding up parameter and rule learning for acyclic probabilistic logic programs

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2020
2020
2024
2024

Publication Types

Select...
2
2

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(2 citation statements)
references
References 11 publications
0
2
0
Order By: Relevance
“…Q4 Does EMPLiFI require more computational resources? Emergency Power Supply (EPS) [18] is propositional, acyclic and contains 24 probabilities 5 . It can be handled by all learner as it has no multi-head ADs.…”
Section: Methodsmentioning
confidence: 99%
See 1 more Smart Citation
“…Q4 Does EMPLiFI require more computational resources? Emergency Power Supply (EPS) [18] is propositional, acyclic and contains 24 probabilities 5 . It can be handled by all learner as it has no multi-head ADs.…”
Section: Methodsmentioning
confidence: 99%
“…In extreme cases, it can converge to incorrect values. To tackle this issue, Asteroidea [6,18] avoids EM iterations for probabilistic rules, which is a specialization of EMPLiFI that supports single-head ADs, but not multi-head ADs. EMBLEM [1] is another EM-based parameter learner.…”
Section: Related Workmentioning
confidence: 99%