Sciweavers

121 search results - page 7 / 25
» Cutset Sampling for Bayesian Networks
Sort
View
AAAI
2008
13 years 9 months ago
Bounding the False Discovery Rate in Local Bayesian Network Learning
Modern Bayesian Network learning algorithms are timeefficient, scalable and produce high-quality models; these algorithms feature prominently in decision support model development...
Ioannis Tsamardinos, Laura E. Brown
JMLR
2010
125views more  JMLR 2010»
13 years 2 months ago
Continuous Time Bayesian Network Reasoning and Learning Engine
We present a continuous time Bayesian network reasoning and learning engine (CTBN-RLE). A continuous time Bayesian network (CTBN) provides a compact (factored) description of a co...
Christian R. Shelton, Yu Fan, William Lam, Joon Le...
JMLR
2006
118views more  JMLR 2006»
13 years 7 months ago
Learning Factor Graphs in Polynomial Time and Sample Complexity
We study the computational and sample complexity of parameter and structure learning in graphical models. Our main result shows that the class of factor graphs with bounded degree...
Pieter Abbeel, Daphne Koller, Andrew Y. Ng
KDD
2005
ACM
103views Data Mining» more  KDD 2005»
14 years 7 months ago
Fast discovery of unexpected patterns in data, relative to a Bayesian network
We consider a model in which background knowledge on a given domain of interest is available in terms of a Bayesian network, in addition to a large database. The mining problem is...
Szymon Jaroszewicz, Tobias Scheffer
GECCO
2008
Springer
171views Optimization» more  GECCO 2008»
13 years 8 months ago
An EDA based on local markov property and gibbs sampling
The key ideas behind most of the recently proposed Markov networks based EDAs were to factorise the joint probability distribution in terms of the cliques in the undirected graph....
Siddhartha Shakya, Roberto Santana