Probabilistic Graphical Models and Markov Networks

DOI10.1007/978-3-642-28900-2_1zbMath1251.68235OpenAlexW2123469030MaRDI QIDQ4649187

Siddhartha Shakya, Roberto Santana

Publication date: 20 November 2012

Published in: Adaptation, Learning, and Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-28900-2_1

Mathematics Subject Classification ID

Knowledge representation (68T30) Graphical methods in statistics (62A09)

Cites Work

• Hierarchical Bayesian optimization algorithm. Toward a new generation of evolutionary algorithms. With a foreword by David E. Goldberg
• High-dimensional Ising model selection using \(\ell _{1}\)-regularized logistic regression
• Linear dependencies represented by chain graphs. With comments and a rejoinder by the authors
• High-dimensional graphs and variable selection with the Lasso
• Markov Random Field Modeling in Image Analysis
• Constructing Free-Energy Approximations and Generalized Belief Propagation Algorithms
• First-Order Methods for Sparse Covariance Selection
• Efficient Markov Network Structure Discovery Using Independence Tests
• Factor graphs and the sum-product algorithm
• Gaussian Markov Random Fields
• A Theory of Cooperative Phenomena
• GRAPHOIDS: Graph-Based Logic for Reasoning about Relevance Relations Or When Would x Tell You More about y If You Already Know z  ?
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Probabilistic Graphical Models and Markov Networks