Learning the structure of Bayesian networks with ancestral and/or heuristic partition

DOI10.1016/j.ins.2021.10.052OpenAlexW3211702995MaRDI QIDQ6188211

No author found.

Publication date: 1 February 2024

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ins.2021.10.052

zbMATH Keywords

Bayesian networkstructure learningheuristic functionorder graph

Mathematics Subject Classification ID

Computational learning theory (68Q32) Bayesian problems; characterization of Bayes procedures (62C10) Learning and adaptive systems in artificial intelligence (68T05) Graph theory (including graph drawing) in computer science (68R10)

Cites Work

• Unnamed Item
• Unnamed Item
• Learning Bayesian networks by hill climbing: efficient methods based on progressive restriction of the neighborhood
• Integer linear programming for the Bayesian network structure learning problem
• The max-min hill-climbing Bayesian network structure learning algorithm
• Modeling by shortest data description
• Causation, prediction, and search
• A Bayesian method for the induction of probabilistic networks from data
• Estimating the dimension of a model
• Learning Bayesian networks: The combination of knowledge and statistical data
• BNC-PSO: structure learning of Bayesian networks by particle swarm optimization
• Bayesian network based label correlation analysis for multi-label classifier chain
• Learning Optimal Bayesian Networks: A Shortest Path Perspective
• Click Prediction for Web Image Reranking Using Multimodal Sparse Coding
• A new look at the statistical model identification

This page was built for publication: Learning the structure of Bayesian networks with ancestral and/or heuristic partition