Inference in credal networks through integer programming

Cassio Polpo De Campos, Fabio Gagliardi Cozman

Research output: Contribution to conferenceConference Paper

19 Scopus citations

Abstract

A credal network associates a directed acyclic graph with a collection of sets of probability measures; it offers 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. Copyright © 2007 by SIPTA.
Original languageAmerican English
Pages145-154
Number of pages10
StatePublished - 1 Dec 2007
Externally publishedYes
EventISIPTA 2007 - Proceedings of the 5th International Symposium on Imprecise Probability: Theories and Applications -
Duration: 1 Dec 2007 → …

Conference

ConferenceISIPTA 2007 - Proceedings of the 5th International Symposium on Imprecise Probability: Theories and Applications
Period1/12/07 → …

Fingerprint

Dive into the research topics of 'Inference in credal networks through integer programming'. Together they form a unique fingerprint.

Cite this