Improving Markov network structure learning using decision trees

MaRDI QIDQ2934000zbMATH OpenFDO

Authors Daniel Lowd, Jesse Davis

Publication date 8 December 2014

Full work available at URL http://jmlr.csail.mit.edu/papers/v15/lowd14a.html

zbMATH Keywords

decision treesprobabilistic methodsnetwork structure learning

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• Efficient Markov Network Structure Discovery Using Independence Tests
• Learning Markov networks: Maximum bounded tree-width graphs
• Approximate structure learning for large Bayesian networks
• Marginal pseudo-likelihood learning of discrete Markov network structures
• Local structure learning in graphical models

Cited in

(8)

• Sparse model selection in the highly under-sampled regime
• Blankets joint posterior score for learning Markov network structures
• Poisson dependency networks: gradient boosted models for multivariate count data
• On using Bayesian networks for complexity reduction in decision trees
• C-Net: a method for generating non-deterministic and dynamic multivariate decision trees
• Learning Markov networks: Maximum bounded tree-width graphs
• Lifted graphical models: a survey
• The IBMAP approach for Markov network structure learning

This page was built for publication: Improving Markov network structure learning using decision trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2934000)