Highly Influenced

# Hill-climbing and branch-and-bound algorithms for exact and approximate inference in credal networks

@article{Cano2007HillclimbingAB, title={Hill-climbing and branch-and-bound algorithms for exact and approximate inference in credal networks}, author={Andr{\'e}s Cano and Manuel G{\'o}mez-Olmedo and Seraf{\'i}n Moral and Joaqu{\'i}n Abell{\'a}n}, journal={Int. J. Approx. Reasoning}, year={2007}, volume={44}, pages={261-280} }

- Published 2007 in Int. J. Approx. Reasoning
DOI:10.1016/j.ijar.2006.07.020

This paper proposes two new algorithms for inference in credal networks. These algorithms enable probability intervals to be obtained for the states of a given query variable. The first algorithm is approximate and uses the hill-climbing technique in the Shenoy–Shafer architecture to propagate in join trees; the second is exact and is a modification of Rocha and Cozman’s branch-and-bound algorithm, but applied to general directed acyclic graphs. 2006 Elsevier Inc. All rights reserved.