Learning Markov networks: Maximum bounded tree-width graphs
From MaRDI portal
Recommendations
- Maximum likelihood bounded tree-width Markov networks
- Efficient learning of Bayesian networks with bounded tree-width
- Learning bounded tree-width Bayesian networks via sampling
- Improving Markov network structure learning using decision trees
- Marginal pseudo-likelihood learning of discrete Markov network structures
Cited in
(23)- Marginal pseudo-likelihood learning of discrete Markov network structures
- Maximum likelihood bounded tree-width Markov networks
- Learning a tree-structured Ising model in order to make predictions
- Learning tractable Bayesian networks in the space of elimination orders
- Graphical models for statistical inference and data assimilation
- Computing partial hypergraphs of bounded width
- Efficient approximation of probability distributions with \(k\)-order decomposable models
- Improving Markov network structure learning using decision trees
- Learning maximum weighted (k+1)-order decomposable graphs by integer linear programming
- scientific article; zbMATH DE number 5968954 (Why is no real title available?)
- Learning bounded tree-width Bayesian networks via sampling
- Graphical Models and Message-Passing Algorithms: Some Introductory Lectures
- Learning loopy graphical models with latent variables: efficient methods and guarantees
- Discovering a junction tree behind a Markov network by a greedy algorithm
- A backward selection procedure for approximating a discrete probability distribution by decomposable models
- Predictive learning on hidden tree-structured Ising models
- scientific article; zbMATH DE number 7626718 (Why is no real title available?)
- Tree decompositions and social graphs
- Region selection in Markov random fields: Gaussian case
- Near-Optimal Learning of Tree-Structured Distributions by Chow and Liu
- High-dimensional structure estimation in Ising models: local separation criterion
- Property testing in Gaussian graphical models: trees and small separation numbers
- Polynomial-time derivation of optimal k-tree topology from Markov networks
This page was built for publication: Learning Markov networks: Maximum bounded tree-width graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2768324)
