Learning Bayesian network structures using weakest mutual-information-first strategy
DOI10.1016/J.IJAR.2019.08.004zbMATH Open1468.68165OpenAlexW2969935099WikidataQ127336344 ScholiaQ127336344MaRDI QIDQ2302789FDOQ2302789
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
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)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- The max-min hill-climbing Bayesian network structure learning algorithm
- Title not available (Why is that?)
- Learning optimal Bayesian networks: a shortest path perspective
- Learning high-dimensional directed acyclic graphs with latent and selection variables
- Local causal and Markov blanket induction for causal discovery and feature selection for classification. Part I: Algorithms and empirical evaluation
- PC algorithm for Gaussian copula graphical models
- BNC-PSO: structure learning of Bayesian networks by particle swarm optimization
- Entropy-based pruning for learning Bayesian networks using BIC
- High-dimensional consistency in score-based and hybrid structure learning
- Efficient score-based Markov blanket discovery
Cited In (1)
Uses Software
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)
