Sciweavers

87 search results - page 1 / 18
» An Improved Lower Bound for Bayesian Network Structure Learn...
Sort
View
NN
1997
Springer
174views Neural Networks» more  NN 1997»
13 years 9 months ago
Learning Dynamic Bayesian Networks
Bayesian networks are directed acyclic graphs that represent dependencies between variables in a probabilistic model. Many time series models, including the hidden Markov models (H...
Zoubin Ghahramani
ECAI
2006
Springer
13 years 8 months ago
Improving Bound Propagation
Abstract. This paper extends previously proposed bound propagation algorithm [11] for computing lower and upper bounds on posterior marginals in Bayesian networks. We improve the b...
Bozhena Bidyuk, Rina Dechter
AIIA
2003
Springer
13 years 10 months ago
Improving the SLA Algorithm Using Association Rules
A bayesian network is an appropriate tool for working with uncertainty and probability, that are typical of real-life applications. In literature we find different approaches for b...
Evelina Lamma, Fabrizio Riguzzi, Andrea Stambazzi,...
NIPS
2008
13 years 6 months ago
Learning Bounded Treewidth Bayesian Networks
With the increased availability of data for complex domains, it is desirable to learn Bayesian network structures that are sufficiently expressive for generalization while at the ...
Gal Elidan, Stephen Gould
ICMLA
2007
13 years 6 months ago
Learning bayesian networks consistent with the optimal branching
We introduce a polynomial-time algorithm to learn Bayesian networks whose structure is restricted to nodes with in-degree at most k and to edges consistent with the optimal branch...
Alexandra M. Carvalho, Arlindo L. Oliveira