Graphoid properties of concepts of independence for sets of probabilities
| Autor: | Fabio Gagliardi Cozman |
|---|---|
| Rok vydání: | 2021 |
| Předmět: |
Formalism (philosophy)
Applied Mathematics Conditional probability 02 engineering and technology Graphoid Lexicographical order Theoretical Computer Science Artificial Intelligence 020204 information systems 0202 electrical engineering electronic engineering information engineering Independence (mathematical logic) 020201 artificial intelligence & image processing Mathematical economics Software Mathematics Probability measure |
| Zdroj: | International Journal of Approximate Reasoning. 131:56-79 |
| ISSN: | 0888-613X |
| DOI: | 10.1016/j.ijar.2020.12.015 |
| Popis: | We examine several concepts of independence associated with (1) credal sets, understood as sets of probability measures, (2) sets of full conditional probabilities, (3) sets of lexicographic probabilities, and (4) sets of desirable gambles. Concepts of independence are evaluated with respect to the graphoid properties they satisfy, as these properties capture important abstract features of “independence”. We emphasize the analysis of sets of probability measures as this is a popular formalism, looking at versions of epistemic, confirmational, and type-5 independence that are based on regular conditioning, as well as complete and strong independence. We then examine analogous concepts of independence for sets of full conditional probabilities, sets of lexicographic probabilities, and sets of desirable gambles. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full Text from ScienceDirect