scientific article; zbMATH DE number 6318819
From MaRDI portal
Publication:5168870
DOI10.1214/12-SSY073zbMath1352.62133arXiv1204.5540MaRDI QIDQ5168870
No author found.
Publication date: 21 July 2014
Full work available at URL: https://arxiv.org/abs/1204.5540
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Markov processes: estimation; hidden Markov models (62M05) Learning and adaptive systems in artificial intelligence (68T05)
Related Items (4)
Unnamed Item ⋮ Near-Optimal Learning of Tree-Structured Distributions by Chow and Liu ⋮ Learning a tree-structured Ising model in order to make predictions ⋮ On testing for parameters in Ising models
Cites Work
- Geometry of the faithfulness assumption in causal inference
- High-dimensional Ising model selection using \(\ell _{1}\)-regularized logistic regression
- Glauber dynamics on trees and hyperbolic graphs
- Approximating partition functions of the two-state spin system
- Counting independent sets up to the tree threshold
- Directed Information Graphs
- Improved Greedy Algorithms for Learning Graphical Models
- Rapid mixing of Gibbs sampling on graphs that are sparse on average
- Note on “Comparison of Model Selection for Regression” by Vladimir Cherkassky and Yunqian Ma
- Stochastic models for large interacting systems and related correlation inequalities
- Information-Theoretic Limits of Selecting Binary Graphical Models in High Dimensions
- Association of Random Variables, with Applications
- Reconstruction of Markov Random Fields from Samples: Some Observations and Algorithms
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication:
