| Full text | |
| Author(s): |
Cozman, Fabio Gagliardi
;
DeBock, J
;
DeCampos, CP
;
DeCooman, G
;
Quaeghebeur, E
;
Wheeler, G
Total Authors: 6
|
| Document type: | Journal article |
| Source: | INTERNATIONAL CONFERENCE ON MACHINE LEARNING, VOL 162; v. 103, p. 9-pg., 2019-01-01. |
| Abstract | |
Graphoid properties attempt to capture the most important features of abstract "independence". We examine which semi-graphoid properties are satisfied by various concepts of independence for credal sets; we focus on variants of epistemic, confirmational, and type-5 independence that are based on regular conditioning. (AU) | |
| FAPESP's process: | 16/18841-0 - Inference and learning algorithms for probabilistic logic programming |
| Grantee: | Fabio Gagliardi Cozman |
| Support Opportunities: | Research Grants - Research Partnership for Technological Innovation - PITE |