Computing lower and upper expectations under epistemic independence

Authors:
Cassio Polpo de Campos;Fabio Gagliardi Cozman
Affiliations:
Escola de Artes, Ciências e Humanidades, USP Leste, Universidade de São Paulo, 03828-000 São Paulo, SP, Brazil;Escola Politécnica, Universidade de São Paulo, São Paulo, SP, Brazil
Venue:
International Journal of Approximate Reasoning
Year:
2007

Citing 13
Cited 7

Probabilistic reasoning in intelligent systems: networks of plausible inference

Probabilistic reasoning in intelligent systems: networks of plausible inference
Bayesian logic

Decision Support Systems - Special issue on logic modeling
2U: an exact interval propagation algorithm for polytrees with binary variables

Artificial Intelligence
Credal networks

Artificial Intelligence
Semigraphoids and structures of probabilistic conditional independence

Annals of Mathematics and Artificial Intelligence
Stochastic Independence in a Coherent Setting

Annals of Mathematics and Artificial Intelligence
Strong Conditional Independence for Credal Sets

Annals of Mathematics and Artificial Intelligence
Algorithms for Conditioning on Events of Zero Lower Probability

Proceedings of the Fifteenth International Florida Artificial Intelligence Research Society Conference
Separation Properties of Sets of Probability Measures

UAI '00 Proceedings of the 16th Conference on Uncertainty in Artificial Intelligence
Conditional independence structures and graphical models

International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems
Graphoid properties of epistemic irrelevance and independence

Annals of Mathematics and Artificial Intelligence
Graphical models for imprecise probabilities

International Journal of Approximate Reasoning
Independence concepts for convex sets of probabilities

UAI'95 Proceedings of the Eleventh conference on Uncertainty in artificial intelligence

Probabilistic abduction without priors

International Journal of Approximate Reasoning
Probabilistic logic with independence

International Journal of Approximate Reasoning
Statistical matching of multiple sources: A look through coherence

International Journal of Approximate Reasoning
Epistemic irrelevance in credal nets: The case of imprecise Markov trees

International Journal of Approximate Reasoning
Compositional models and conditional independence in evidence theory

International Journal of Approximate Reasoning
Independent natural extension

Artificial Intelligence
Generalizing inference rules in a coherence-based probabilistic default reasoning

International Journal of Approximate Reasoning

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper investigates the computation of lower/upper expectations that must cohere with a collection of probabilistic assessments and a collection of judgements of epistemic independence. New algorithms, based on multilinear programming, are presented, both for independence among events and among random variables. Separation properties of graphical models are also investigated.