Uncertainty in Artificial Intelligence
First Name   Last Name   Password   Forgot Password   Log in!
    Proceedings   Proceeding details   Article details         Authors         Search    
Inference in Polytrees with Sets of Probabilities
Jose Ferreira da Rocha, Fabio Cozman, Cassio de Campos
Inferences in directed acyclic graphs associated with probability sets and probability intervals are NP-hard, even for polytrees. In this paper we focus on such inferences, and propose: 1) a substantial improvement on Tessems A / R algorithm FOR polytrees WITH probability intervals; 2) a new algorithm FOR direction - based local search(IN sets OF probability) that improves ON existing methods; 3) a collection OF branch - AND - bound algorithms that combine the previous techniques.The first two techniques lead TO approximate solutions, WHILE branch - AND - bound procedures can produce either exact OR approximate solutions.We report ON dramatic improvements ON existing techniques FOR inference WITH probability sets AND intervals, IN SOME cases reducing the computational effort BY many orders OF magnitude.
Pages: 217-224
PS Link:
PDF Link: /papers/03/p217-ferreira_da_rocha.pdf
@INPROCEEDINGS{Ferreira da Rocha03,
AUTHOR = "Jose Ferreira da Rocha and Fabio Cozman and Cassio de Campos",
TITLE = "Inference in Polytrees with Sets of Probabilities",
BOOKTITLE = "Proceedings of the Nineteenth Conference Annual Conference on Uncertainty in Artificial Intelligence (UAI-03)",
PUBLISHER = "Morgan Kaufmann",
ADDRESS = "San Francisco, CA",
YEAR = "2003",
PAGES = "217--224"

hosted by DSL   •   site info   •   help