Inference in Credal Networks Through Integer Programming

Autor(es)

de Campos, Cassio Polpo ; Cozman, Fabio Gagliardi ; DeCooman, G ; Vejnarova, J ; Zaffalon, M

• Tipo de documento: Artigo Científico
• Fonte: ISIPTA 07-PROCEEDINGS OF THE FIFTH INTERNATIONAL SYMPOSIUM ON IMPRECISE PROBABILITY:THEORIES AND APPLICATIONS; v. N/A, p. 3-pg., 2007-01-01.

Resumo

A credal network associates a directed acyclic graph with a collection of sets of probability measurres; it of a compact representation for sets of multivariate distributions. In this paper we present a new algorithm for inference in credal networks based on an integer programming reformulation. We are concerned with computation of lower/upper probabilities for a variable in a given credal network. Experiments reported in this paper indicate that this new algorithm has better performance than existing ones for some important classes of networks. (AU)

• Processo FAPESP: 04/09568-0 - Algoritmos para inferencia e aprendizado para logica probabilistica com relacoes de independencia.
• Beneficiário: Fabio Gagliardi Cozman
• Modalidade de apoio: Auxílio à Pesquisa - Regular