Reconstruction of Markov Random Fields from Samples: Some Observations and Algorithms
From MaRDI portal
Publication:5891104
DOI10.1137/100796029zbMath1271.68239OpenAlexW1982687752MaRDI QIDQ5891104
Elchanan Mossel, Guy Bresler, Allan Sly
Publication date: 24 July 2013
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/100796029
Random fields (60G60) Random fields; image analysis (62M40) Nonnumerical algorithms (68W05) Graph algorithms (graph-theoretic aspects) (05C85) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)
Related Items
Efficient learning of discrete graphical models*, Estimating the interaction graph of stochastic neuronal dynamics by observing only pairs of neurons, Lower bounds for testing graphical models: colorings and antiferromagnetic Ising models, Multi-group binary choice with social interaction and a random communication structure -- a random graph approach, Exact recovery in block spin Ising models at the critical line, Region selection in Markov random fields: Gaussian case, Near-Optimal Learning of Tree-Structured Distributions by Chow and Liu, Sparse model selection in the highly under-sampled regime, Fluctuation results for general block spin Ising models, High-dimensional Ising model selection using \(\ell _{1}\)-regularized logistic regression, Fluctuations for block spin Ising models, Unnamed Item
