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

DOI10.1007/978-3-540-85363-3_28zbMath1159.68636WikidataQ98837550 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

68Q25: Analysis of algorithms and problem complexity

68W20: Randomized algorithms

Related Items

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