Sciweavers

25 search results - page 4 / 5
» Learning Bounded Treewidth Bayesian Networks
Sort
View
VLDB
2006
ACM
162views Database» more  VLDB 2006»
14 years 11 months ago
Dependency trees in sub-linear time and bounded memory
We focus on the problem of efficient learning of dependency trees. Once grown, they can be used as a special case of a Bayesian network, for PDF approximation, and for many other u...
Dan Pelleg, Andrew W. Moore
ALT
2004
Springer
14 years 7 months ago
Relative Loss Bounds and Polynomial-Time Predictions for the k-lms-net Algorithm
We consider a two-layer network algorithm. The first layer consists of an uncountable number of linear units. Each linear unit is an LMS algorithm whose inputs are first “kerne...
Mark Herbster
JMLR
2010
140views more  JMLR 2010»
13 years 5 months ago
Mean Field Variational Approximation for Continuous-Time Bayesian Networks
Continuous-time Bayesian networks is a natural structured representation language for multicomponent stochastic processes that evolve continuously over time. Despite the compact r...
Ido Cohn, Tal El-Hay, Nir Friedman, Raz Kupferman
RECOMB
2004
Springer
14 years 11 months ago
Learning Regulatory Network Models that Represent Regulator States and Roles
Abstract. We present an approach to inferring probabilistic models of generegulatory networks that is intended to provide a more mechanistic representation of transcriptional regul...
Keith Noto, Mark Craven
JMLR
2006
118views more  JMLR 2006»
13 years 10 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