Learning Bayesian networks with local structure, mixed variables, and exact algorithms

DOI10.1016/j.ijar.2019.09.002zbMath1468.68173OpenAlexW2974856897MaRDI QIDQ2302809

Ralf Eggeling, Topi Talvitie, Mikko Koivisto

Publication date: 26 February 2020

Published in: International Journal of Approximate Reasoning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ijar.2019.09.002

zbMATH Keywords

Bayesian networksdecision treesexact algorithmsstructure learning

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Probabilistic graphical models (62H22)

Related Items (2)

Unnamed Item ⋮ Hybrid variable monitoring: an unsupervised process monitoring framework with binary and continuous variables

Uses Software

• UCI-ml
• bnlearn

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Integer linear programming for the Bayesian network structure learning problem
• Bayesian learning of Bayesian networks with informative priors
• The max-min hill-climbing Bayesian network structure learning algorithm
• CART and best-ortho-basis: a connection
• Being Bayesian about network structure. A Bayesian approach to structure discovery in Bayesian networks
• Bayesian learning for neural networks
• Optimal dyadic decision trees
• Learning hybrid Bayesian networks using mixtures of truncated exponentials
• Learning Optimal Bayesian Networks: A Shortest Path Perspective
• Minimax-optimal classification with dyadic decision trees
• A Bayesian CART algorithm
• Learning Discrete Bayesian Networks from Continuous Data

This page was built for publication: Learning Bayesian networks with local structure, mixed variables, and exact algorithms