Using probability trees to compute marginals with imprecise probabilities

Cano Utrera, Andrés; Moral Callejón, Serafín

doi:10.1016/S0888-613X(01)00046-9

1-s2.0-S0888613X01000469-main.pdf (538.6Kb)

Identificadores

URI: https://hdl.handle.net/10481/77876

DOI: 10.1016/S0888-613X(01)00046-9

Exportar

Editorial

Elsevier

Materia

Dependence graphs

Interval probabilities

Propagation algorithms

Probability trees

Inteligencia artificial

Artificial intelligence

Date

2001-11-12

Referencia bibliográfica

Andrés Cano, Serafín Moral, Using probability trees to compute marginals with imprecise probabilities, International Journal of Approximate Reasoning, Volume 29, Issue 1, 2002, Pages 1-46, ISSN 0888-613X, [https://doi.org/10.1016/S0888-613X(01)00046-9]

Abstract

This paper presents an approximate algorithm to obtain a posteriori intervals of probability, when available information is also given with intervals. The algorithm uses probability trees as a means of representing and computing with the convex sets of probabilities associated to the intervals.

Collections

DCCIA - Artículos

Except where otherwise noted, this item's license is described as Attribution-NonCommercial-NoDerivatives 4.0 Internacional