Climbing the Hills of Compiled Credal Networks

Climbing the Hills of Compiled Credal Networks (2007)

Cached

Download Links

[www.iam.unibe.ch]

by Rolf Haenni

Venue:

5TH INTERNATIONAL SYMPOSIUM ON IMPRECISE PROBABILITY: THEORIES AND APPLICATIONS, PRAGUE, CZECH REPUBLIC

BibTeX

@MISC{Haenni07climbingthe,
    author = {Rolf Haenni},
    title = {Climbing the Hills of Compiled Credal Networks},
    year = {2007}
}

Bookmark

OpenURL

Abstract

This paper introduces a new approximate inference algorithm for credal networks. The algorithm consists of two major steps. It starts by representing the credal network as a compiled logical theory. The resulting graphical structure is the basis on which the subsequent steepest-ascent hill-climbing algorithm operates. The output of the algorithm is an inner approximation of the exact lower and upper posterior probabilities.

Citations

5666	Probabilistic reasoning in intelligent systems - Pearl - 1988
2959	Artificial Intelligence: a Modern Approach - Russell, Norvig - 1995
797	Computational Geometry: Algorithms and Applications - Berg, Kreveld, et al. - 1997
697	Fellows M: Parameterized Complexity - Downey - 1999
240	Context-specific independence in bayesian networks - Boutilier, Friedman, et al. - 1996
229	Bucket elimination: a unifying framework for reasoning - Dechter - 1999
203	Bayesian networks without tears - Charniak - 1991
183	The Enterprise of Knowledge - Levi - 1980
121	A knowledge compilation map - Darwiche, Marquis - 2002
111	Axioms for probability and belief-function propagation - Shenoy, Shafer - 1988
86	A differential approach to inference in Bayesian networks - Darwiche - 2003
72	Credal networks - Cozman - 2000
43	Compiling relational Bayesian networks for exact inference - Chavira, Darwiche, et al. - 2006
42	A compiler for deterministic, decomposable negation normal form - Darwiche - 2002
42	The theory of interval-probability as a unifying concept for uncertainty - Weichselberger - 1999
40	A logical approach to factoring belief networks - Darwiche - 2002
37	2U: an exact interval propagation algorithm for polytrees with binary variables - Fagiuoli, Zaffalon - 1998
34	A survery of concepts of independence for imprecise probability - Couso, Moral, et al.
31	A.: Compiling bayesian networks with local structure - Chavira, Darwiche - 2005
29	Interval probability propagation - Tessem - 1992
25	Graphical models for imprecise probabilities - Cozman - 2004
22	A.: Compiling bayesian networks using variable elimination - Chavira, Darwiche - 2007
22	Solving Bayesian networks by weighted model counting - Sang, Beame, et al. - 2005
21	Using probability trees to compute marginals with imprecise probabilities - Cano, Moral - 2002
19	S.: Convex sets of probabilities propagation by simulated annealing on a tree of cliques - Cano, Cano, et al. - 1994
18	The inferential complexity of Bayesian and credal networks - Campos, Cozman - 2005
16	A genetic algorithm to approximate convex sets of probabilities - Cano, Moral - 1996
12	Propagation of convex sets of probabilities in directed acyclic networks. Uncertainty in Intelligent Systems, edited by - Cano, Moral, et al. - 1993
12	F.G.: IPE and L2U: Approximate algorithms for credal networks - Ide, Cozman - 2004
12	Propositional DAGs: A new graph-based language for representing Boolean functions - Wachter, Haenni - 2006
9	F.G.: Inference in credal networks with branch-and-bound algorithms - Rocha, Cozman
9	de Campos, Inference in polytrees with sets of probabilities - Rocha, Cozman, et al. - 2003
9	On probability intervals - Pearl - 1988
7	Hill-climbing and branch-and-bound algorithms for exact and approximate inference in credal networks - Cano, Gomez, et al. - 2007
7	A review of propagation algorithms for imprecise probabilities - Cano, Moral - 1999
7	Multi-state directed acyclic graphs - Wachter, Haenni - 2007
6	Locally Specified Credal Networks - Antonucci, Zaffalon - 2006
6	Cozman: Approximate Inference in Credal Networks by Variational Mean Field Methods - Ide, G - 2005
6	Computation in valuation algebras. Handbook of Defeasible Reasoning and Uncertainty Management Systems, volume 5: Algorithms for Uncertainty and Defeasible Reasoning - Kohlas, Shenoy - 2000
5	Exact and approximate local computation in semiring induced valuation algebras - Kohlas, Wilson - 2006
4	Computing probability intervals with simulated annealing and probability trees - Cano, Fernandez-Luna, et al.
4	Implementation of a generic architecture for local computation - Pouly - 2004
4	NENOK 1.1 user guide - Pouly - 2006
3	Logical compilation of Bayesian networks - Wachter, Haenni - 2006
2	de Campos. Local computation in credal networks - Cozman, P - 2004
2	Interval-valued probabilities. The Imprecise Probabilities Project. IPP Home Page, available at http://ippserv.rug.ac.be - Kyburg - 1998