Sciweavers

UAI
1996
13 years 6 months ago
Asymptotic Model Selection for Directed Networks with Hidden Variables
We extend the Bayesian Information Criterion (BIC), an asymptotic approximation for the marginal likelihood, to Bayesian networks with hidden variables. This approximation can be ...
Dan Geiger, David Heckerman, Christopher Meek
UAI
1996
13 years 6 months ago
A Qualitative Markov Assumption and Its Implications for Belief Change
The study of belief change has been an active area in philosophy and AI. In recent years, two special cases of belief change, belief revision and belief update, have been studied ...
Nir Friedman, Joseph Y. Halpern
UAI
1996
13 years 6 months ago
Learning Bayesian Networks with Local Structure
In this paper we examine a novel addition to the known methods for learning Bayesian networks from data that improves the quality of the learned networks. Our approach explicitly ...
Nir Friedman, Moisés Goldszmidt
UAI
1996
13 years 6 months ago
An evaluation of structural parameters for probabilistic reasoning: Results on benchmark circuits
Many algorithms for processing probabilistic networks are dependent on the topological properties of the problem's structure. Such algorithmse.g., clustering, conditioning ar...
Yousri El Fattah, Rina Dechter
UAI
1996
13 years 6 months ago
Topological parameters for time-space tradeoff
In this paper we propose a family of algorithms combining treeclustering with conditioning that trade space for time. Such algorithms are useful for reasoning in probabilistic and...
Rina Dechter
UAI
1996
13 years 6 months ago
Bucket elimination: A unifying framework for probabilistic inference
Probabilistic inference algorithms for belief updating, nding the most probable explanation, the maximum a posteriori hypothesis, and the maximum expected utility are reformulated...
Rina Dechter
UAI
1996
13 years 6 months ago
Some Experiments with Real-time Decision Algorithms
Real-time Decision algorithms are a class of incremental resource-bounded [Horvitz, 89] or anytime [Dean, 93] algorithms for evaluating influence diagrams. We present a test domai...
Bruce D'Ambrosio, Scott Burgess
UAI
1996
13 years 6 months ago
Efficient Approximations for the Marginal Likelihood of Incomplete Data Given a Bayesian Network
We discuss Bayesian methods for learning Bayesian networks when data sets are incomplete. In particular, we examine asymptotic approximations for the marginal likelihood of incomp...
David Maxwell Chickering, David Heckerman