Probabilistic inductive constraint logic

被引:0
作者
Fabrizio Riguzzi
Elena Bellodi
Riccardo Zese
Marco Alberti
Evelina Lamma
机构
[1] Dipartimento di Matematica e Informatica – University of Ferrara,
[2] Dipartimento di Ingegneria – University of Ferrara,undefined
来源
Machine Learning | 2021年 / 110卷
关键词
D O I
暂无
中图分类号
学科分类号
摘要
Probabilistic 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.
引用
收藏
页码:723 / 754
页数:31
相关论文
共 46 条
  • [1] Alberti M(2008)Verifiable agent interaction in abductive logic programming: The SCIFF framework ACM Transactions on Computer Logic 9 29:1-29:43
  • [2] Chesani F(1991)Acyclic programs New Generation Computing 9 335-363
  • [3] Gavanelli M(2015)Structure learning of probabilistic logic programs by searching the clause space Theory and Practice of Logic Programming 15 169-212
  • [4] Lamma E(1999)Scaling up inductive logic programming by learning from interpretations Data Mining and Knowledge Discovery 3 59-93
  • [5] Mello P(1998)Top-down induction of first-order logical decision trees Artificial Intelligence 101 285-297
  • [6] Torroni P(1847)Méthode générale pour la résolution des systemes d’équations simultanées Comptes Rendus Academic Science Paris 225 536-538
  • [7] Apt KR(1997)Clausal discovery Machine Learning 26 99-146
  • [8] Bezem M(1994)First-Order jk-Clausal Theories are PAC-Learnable Artificial Intelligence 70 375-392
  • [9] Bellodi E(1977)Maximum likelihood from incomplete data via the EM algorithm Journal of the Royal Statistical Society: Series B (Methodological) 39 1-38
  • [10] Riguzzi F(2015)Bandit-based Monte-Carlo structure learning of probabilistic logic programs Machine Learning 100 127-156