Sciweavers

1547 search results - page 262 / 310
» Randomized Variable Elimination
Sort
View
HIS
2003
13 years 11 months ago
A Hybrid Approach for Learning Parameters of Probabilistic Networks from Incomplete Databases
– Probabilistic Inference Networks are becoming increasingly popular for modeling and reasoning in uncertain domains. In the past few years, many efforts have been made in learni...
S. Haider
SODA
2001
ACM
79views Algorithms» more  SODA 2001»
13 years 11 months ago
Learning Markov networks: maximum bounded tree-width graphs
Markov networks are a common class of graphical models used in machine learning. Such models use an undirected graph to capture dependency information among random variables in a ...
David R. Karger, Nathan Srebro
UAI
2001
13 years 11 months ago
Hypothesis Management in Situation-Specific Network Construction
This paper considers the problem of knowledgebased model construction in the presence of uncertainty about the association of domain entities to random variables. Multi-entity Bay...
Kathryn B. Laskey, Suzanne M. Mahoney, Ed Wright
UAI
2004
13 years 11 months ago
From Fields to Trees
We present new MCMC algorithms for computing the posterior distributions and expectations of the unknown variables in undirected graphical models with regular structure. For demon...
Firas Hamze, Nando de Freitas
UAI
2004
13 years 11 months ago
Bayesian Learning in Undirected Graphical Models: Approximate MCMC Algorithms
Bayesian learning in undirected graphical models--computing posterior distributions over parameters and predictive quantities-is exceptionally difficult. We conjecture that for ge...
Iain Murray, Zoubin Ghahramani