Inference in Credal Networks Through Integer Programming

C. P. de Campos; F. G. Cozman

Inference in Credal Networks Through Integer Programming

C. P. de Campos
, F. G. Cozman

School of Electronics, Electrical Engineering and Computer Science

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

22 Citations (Scopus)

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.

Original language	English
Title of host publication	International Symposium on Imprecise Probability: Theories and Applications (ISIPTA)
Publisher	SIPTA
Pages	145-154
Number of pages	10
Publication status	Published - 2007

Bibliographical note

(oral presentation, blind peer reviewed by >3 reviewers)

Access to Document

http://www.eeecs.qub.ac.uk/~c.decampos/publist/papers/decampos2007b.pdf

Cite this

@inproceedings{0fdd7e2146474c8f85e422e6c23836e8,

title = "Inference in Credal Networks Through Integer Programming",

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.",

author = "\{de Campos\}, \{C. P.\} and Cozman, \{F. G.\}",

note = "(oral presentation, blind peer reviewed by >3 reviewers)",

year = "2007",

language = "English",

pages = "145--154",

booktitle = "International Symposium on Imprecise Probability: Theories and Applications (ISIPTA)",

publisher = "SIPTA",

}

TY - GEN

T1 - Inference in Credal Networks Through Integer Programming

AU - de Campos, C. P.

AU - Cozman, F. G.

N1 - (oral presentation, blind peer reviewed by >3 reviewers)

PY - 2007

Y1 - 2007

N2 - 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.

AB - 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.

M3 - Conference contribution

SP - 145

EP - 154

BT - International Symposium on Imprecise Probability: Theories and Applications (ISIPTA)

PB - SIPTA

ER -

Inference in Credal Networks Through Integer Programming

Abstract

Bibliographical note

Access to Document

Fingerprint

Cite this