Probabilistic inductive constraint logic
-
Published:2020-11-10
Issue:4
Volume:110
Page:723-754
-
ISSN:0885-6125
-
Container-title:Machine Learning
-
language:en
-
Short-container-title:Mach Learn
Author:
Riguzzi Fabrizio, Bellodi Elena, Zese RiccardoORCID, Alberti Marco, Lamma Evelina
Abstract
AbstractProbabilistic logical models deal effectively with uncertain relations and entities typical of many real world domains. In the field of probabilistic logic programming usually the aim is to learn these kinds of models to predict specific atoms or predicates of the domain, called target atoms/predicates. However, it might also be useful to learn classifiers for interpretations as a whole: to this end, we consider the models produced by the inductive constraint logic system, represented by sets of integrity constraints, and we propose a probabilistic version of them. Each integrity constraint is annotated with a probability, and the resulting probabilistic logical constraint model assigns a probability of being positive to interpretations. To learn both the structure and the parameters of such probabilistic models we propose the system PASCAL for “probabilistic inductive constraint logic”. Parameter learning can be performed using gradient descent or L-BFGS. PASCAL has been tested on 11 datasets and compared with a few statistical relational systems and a system that builds relational decision trees (TILDE): we demonstrate that this system achieves better or comparable results in terms of area under the precision–recall and receiver operating characteristic curves, in a comparable execution time.
Funder
Università degli Studi di Ferrara
Publisher
Springer Science and Business Media LLC
Subject
Artificial Intelligence,Software
Reference46 articles.
1. Alberti, M., Bellodi, E., Cota, G., Lamma, E., Riguzzi, F., & Zese, R. (2016). Probabilistic constraint logic theories. In: A. Hommersom, S. Abdallah (Eds.) Proceedings of the 3nd international workshop on probabilistic logic programming (PLP), CEUR Workshop Proceedings (vol. 1661, pp. 15–28). Sun SITE Central Europe, Aachen, Germany. http://ceur-ws.org/Vol-1661/#paper-02 2. Alberti, M., Chesani, F., Gavanelli, M., Lamma, E., Mello, P., & Torroni, P. (2008). Verifiable agent interaction in abductive logic programming: The SCIFF framework. ACM Transactions on Computer Logic, 9(4), 29:1–29:43. 3. Alberti, M., Cota, G., Riguzzi, F., & Zese, R. (2016). Probabilistic logical inference on the web. In: G. Adorni, S. Cagnoni, M. Gori, M. Maratea (Eds.) AI*IA 2016, Lecture Notes in Computer Science, vol. 10037, pp. 351–363. Springer https://doi.org/10.1007/978-3-319-49130-1_26. 4. Apt, K. R., & Bezem, M. (1991). Acyclic programs. New Generation Computing, 9(3–4), 335–363. 5. Bellodi, E., & Riguzzi, F. (2012). Learning the structure of probabilistic logic programs. In S. Muggleton, A. Tamaddoni-Nezhad, & F. Lisi (Eds.) 22nd international conference on inductive logic programming, LNCS (Vol. 7207, pp. 61–75). Berlin: Springer.
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
|
|