From Fields to Trees
We present new MCMC algorithms for computing the posterior distributions and expectations of the unknown variables in undirected graphical models with regular structure. For demonstration purposes, we focus on Markov Random Fields (MRFs). By partitioning the MRFs into non-overlapping trees, it is po...
Main Authors: | Hamze, F, de Freitas, N |
---|---|
Format: | Conference item |
Published: |
AUAI Press
2004
|
Similar Items
-
Intracluster Moves for Constrained Discrete−Space MCMC
by: Hamze, F, et al.
Published: (2010) -
Hot Coupling: A Particle Approach to Inference and Normalization on Pairwise Undirected Graphs
by: Hamze, F, et al.
Published: (2005) -
Information Theory Tools to Rank MCMC Algorithms on Probabilistic Graphical Models
by: Hamze, F, et al.
Published: (2006) -
Self-Avoiding Random Dynamics on Integer Complex Systems
by: Hamze, F, et al.
Published: (2013) -
Self−Avoiding Random Dynamics on Integer Complex Systems
by: Hamze, F, et al.
Published: (2013)