Sciweavers

759 search results - page 45 / 152
» Structured Learning with Approximate Inference
Sort
View
ICPR
2008
IEEE
15 years 11 months ago
Approximating a non-homogeneous HMM with Dynamic Spatial Dirichlet Process
In this work we present a model that uses a Dirichlet Process (DP) with a dynamic spatial constraints to approximate a non-homogeneous hidden Markov model (NHMM). The coefficient ...
Haijun Ren, Leon N. Cooper, Liang Wu, Predrag Nesk...
UAI
2003
14 years 11 months ago
Approximate Decomposition: A Method for Bounding and Estimating Probabilistic and Deterministic Queries
In this paper, we introduce a method for approximating the solution to inference and optimization tasks in uncertain and deterministic reasoning. Such tasks are in general intract...
David Larkin
ICMLA
2009
14 years 7 months ago
Exact Graph Structure Estimation with Degree Priors
We describe a generative model for graph edges under specific degree distributions which admits an exact and efficient inference method for recovering the most likely structure. T...
Bert Huang, Tony Jebara
JMLR
2012
13 years 4 days ago
Low rank continuous-space graphical models
Constructing tractable dependent probability distributions over structured continuous random vectors is a central problem in statistics and machine learning. It has proven diffic...
Carl Smith, Frank Wood, Liam Paninski
BMCBI
2007
154views more  BMCBI 2007»
14 years 9 months ago
Inferring biological networks with output kernel trees
Background: Elucidating biological networks between proteins appears nowadays as one of the most important challenges in systems biology. Computational approaches to this problem ...
Pierre Geurts, Nizar Touleimat, Marie Dutreix, Flo...