Sciweavers

22 search results - page 2 / 5
» Bayesian Learning in Undirected Graphical Models: Approximat...
Sort
View
ICML
2004
IEEE
14 years 6 months ago
Variational methods for the Dirichlet process
Variational inference methods, including mean field methods and loopy belief propagation, have been widely used for approximate probabilistic inference in graphical models. While ...
David M. Blei, Michael I. Jordan
ICML
2010
IEEE
13 years 6 months ago
Particle Filtered MCMC-MLE with Connections to Contrastive Divergence
Learning undirected graphical models such as Markov random fields is an important machine learning task with applications in many domains. Since it is usually intractable to learn...
Arthur Asuncion, Qiang Liu, Alexander T. Ihler, Pa...
JMLR
2010
140views more  JMLR 2010»
13 years 10 days ago
Learning Non-Stationary Dynamic Bayesian Networks
Learning dynamic Bayesian network structures provides a principled mechanism for identifying conditional dependencies in time-series data. An important assumption of traditional D...
Joshua W. Robinson, Alexander J. Hartemink
JETAI
1998
110views more  JETAI 1998»
13 years 5 months ago
Independency relationships and learning algorithms for singly connected networks
Graphical structures such as Bayesian networks or Markov networks are very useful tools for representing irrelevance or independency relationships, and they may be used to e cientl...
Luis M. de Campos
COLT
2004
Springer
13 years 11 months ago
Graphical Economics
: We introduce a graph-theoretic generalization of classical Arrow-Debreu economics, in which an undirected graph specifies which consumers or economies are permitted to engage in...
Sham Kakade, Michael J. Kearns, Luis E. Ortiz