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

DOI10.1016/J.IJAR.2019.08.004MaRDI QIDQ2302789zbMATHOpenAlexWikidataFDO

Authors Xiaolong Qi, Xiaocong Fan, Yang Gao, Yanfang Liu

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

Markov chainBayesian networkmutual informationconditional independencevariable orderingPC-algorithm

Mathematics Subject Classification ID

Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Learning and adaptive systems in artificial intelligence (68T05) Probabilistic graphical models (62H22)

Recommendations

• Mutual-information-inspired heuristics for constraint-based causal structure learning
• A PC algorithm variation for ordinal variables
• Learning Bayesian Network Structure Using Genetic Algorithm with Consideration of the Node Ordering via Principal Component Analysis
• An improved Bayesian network structure learning algorithm based on the conditional independence test
• Towards a fast and efficient algorithm for learning Bayesian network

Cites work

• scientific article; zbMATH DE number 1493045 (Why is no real title available?)
• BNC-PSO: structure learning of Bayesian networks by particle swarm optimization
• Efficient score-based Markov blanket discovery
• Entropy-based pruning for learning Bayesian networks using BIC
• Estimating high-dimensional directed acyclic graphs with the PC-algorithm
• High-dimensional consistency in score-based and hybrid structure learning
• Learning high-dimensional directed acyclic graphs with latent and selection variables
• Learning optimal Bayesian networks: a shortest path perspective
• Local causal and Markov blanket induction for causal discovery and feature selection for classification. Part I: Algorithms and empirical evaluation
• PC algorithm for nonparanormal graphical models
• Probabilistic graphical models.
• The max-min hill-climbing Bayesian network structure learning algorithm

Cited in

(1)

• Mutual-information-inspired heuristics for constraint-based causal structure learning

Describes a project that uses

Uses Software

• BNT
• TETRAD
• Adaptive Threshold

This page was built for publication: Learning Bayesian network structures using weakest mutual-information-first strategy

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