Computing intervals of probabilities with simulated annealing and probability trees

0Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The paper shows a method to compute a posteriori intervals of probabilities when the initial conditional information is given also with intervals of probabilities. The right way of doing an exact computation is with the associated convex set of probabilities. Probability trees are used to represent these initial conditional convex sets, because they save enormously the required space. This paper proposes a simulated annealing algorithm, using probability trees as the representation of the convex sets, in order to compute the a posteriori intervals.

Cite

CITATION STYLE

APA

Cano, A., & Moral, S. (2001). Computing intervals of probabilities with simulated annealing and probability trees. In Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science) (Vol. 2143, pp. 278–289). Springer Verlag. https://doi.org/10.1007/3-540-44652-4_25

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free