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

• Autores: Andrés Cano Utrera , Manuel Gómez Olmedo , Serafín Moral Callejón , Joaquín Abellán Mulero
• Localización: International journal of approximate reasoning, ISSN 0888-613X, Vol. 44, Nº 3, 2007, págs. 261-280
• Idioma: inglés
• DOI: 10.1016/j.ijar.2006.07.020
• Texto completo no disponible (Saber más ...)
• Resumen

  • 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