Sciweavers

1423 search results - page 204 / 285
» Object-Oriented Bayesian Networks
Sort
View
GECCO
2008
Springer
171views Optimization» more  GECCO 2008»
15 years 1 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
JMLR
2006
118views more  JMLR 2006»
15 years 19 days 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
JCB
2002
131views more  JCB 2002»
15 years 10 days ago
Modeling and Simulation of Genetic Regulatory Systems: A Literature Review
In order to understand the functioning of organisms on the molecular level, we need to know which genes are expressed, when and where in the organism, and to which extent. The reg...
Hidde de Jong
123
Voted
JMLR
2010
202views more  JMLR 2010»
14 years 7 months ago
Learning the Structure of Deep Sparse Graphical Models
Deep belief networks are a powerful way to model complex probability distributions. However, it is difficult to learn the structure of a belief network, particularly one with hidd...
Ryan Prescott Adams, Hanna M. Wallach, Zoubin Ghah...
BMCBI
2010
178views more  BMCBI 2010»
15 years 24 days ago
Selecting high-dimensional mixed graphical models using minimal AIC or BIC forests
Background: Chow and Liu showed that the maximum likelihood tree for multivariate discrete distributions may be found using a maximum weight spanning tree algorithm, for example K...
David Edwards, Gabriel C. G. de Abreu, Rodrigo Lab...