Learning Bayesian network structures using weakest mutual-information-first strategy

DOI10.1016/j.ijar.2019.08.004zbMath1468.68165MaRDI QIDQ2302789

Yanfang Liu, Yang Gao, Xiaolong Qi, Xiaocong Fan

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.08.004

zbMATH Keywords

mutual information; Markov chain; conditional independence; Bayesian network; variable ordering; PC-algorithm

Mathematics Subject Classification ID

68T05: Learning and adaptive systems in artificial intelligence

60J20: Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.)

62H22: Probabilistic graphical models

Uses Software

• BNT
• TETRAD
• Adaptive Threshold

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Learning high-dimensional directed acyclic graphs with latent and selection variables
• The max-min hill-climbing Bayesian network structure learning algorithm
• Entropy-based pruning for learning Bayesian networks using BIC
• High-dimensional consistency in score-based and hybrid structure learning
• BNC-PSO: structure learning of Bayesian networks by particle swarm optimization
• Efficient score-based Markov blanket discovery
• Learning Optimal Bayesian Networks: A Shortest Path Perspective
• PC algorithm for Gaussian copula graphical models