Inducing Probabilistic Relational Rules from Probabilistic ExamplesVise andre og tillknytning
2015 (engelsk)Inngår i: Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence / [ed] Wooldridge M.; Yang Q., Palo Alto: AAAI Press, 2015, s. 1835-1842Konferansepaper, Publicerat paper (Fagfellevurdert)
Abstract [en]
We study the problem of inducing logic programs in a probabilistic setting, in which both the example descriptions and their classification can be probabilistic. The setting is incorporated in the probabilistic rule learner ProbFOIL(+), which combines principles of the rule learner FOIL with ProbLog, a probabilistic Prolog. We illustrate the approach by applying it to the knowledge base of NELL, the Never-Ending Language Learner.
sted, utgiver, år, opplag, sider
Palo Alto: AAAI Press, 2015. s. 1835-1842
Serie
IJCAI International Joint Conference on Artificial Intelligence, ISSN 1045-0823
HSV kategori
Identifikatorer
URN: urn:nbn:se:oru:diva-91704ISI: 000442637801128Scopus ID: 2-s2.0-84949921090ISBN: 9781577357384 (tryckt)OAI: oai:DiVA.org:oru-91704DiVA, id: diva2:1553458
Konferanse
24th International Joint Conference on Artificial Intelligence (IJCAI 2015), Buenos Aires, Argentina, July 25-31, 2015
Merknad
Funding Agency:
FWO
2021-05-102021-05-102021-05-11bibliografisk kontrollert