Reconstruction of Markov Random Fields from Samples: Some Observations and Algorithms

DOI10.1007/978-3-540-85363-3_28zbMath1159.68636OpenAlexW1735349781WikidataQ98837550 ScholiaQ98837550MaRDI QIDQ5900475

Guy Bresler, Elchanan Mossel, Allan Sly

Publication date: 27 November 2008

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-85363-3_28

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Randomized algorithms (68W20)

Related Items

Ising model selection using ℓ ₁-regularized linear regression: a statistical mechanics analysis*, Learning loopy graphical models with latent variables: efficient methods and guarantees, Computational implications of reducing data to sufficient statistics, Reconstructing pedigrees: Some identifiability questions for a recombination-mutation model, Learning a tree-structured Ising model in order to make predictions, An oracle approach for interaction neighborhood estimation in random fields, Structure estimation for discrete graphical models: generalized covariance matrices and their inverses, Estimating the interaction graph of stochastic neural dynamics, AMP Chain Graphs: Minimal Separators and Structure Learning Algorithms, A decomposition-based algorithm for learning the structure of multivariate regression chain graphs, A global approach for learning sparse Ising models, High-dimensional structure estimation in Ising models: local separation criterion, Estimating time-varying networks, Sharp oracle inequalities and slope heuristic for specification probabilities estimation in discrete random fields, Exact recovery in the Ising blockmodel, Unnamed Item, Topology discovery of sparse random graphs with few participants, Property testing in high-dimensional Ising models, Unnamed Item, Identifying interacting pairs of sites in Ising models on a countable set