Structure space of Bayesian networks is dramatically reduced by subdividing it in sub-networks

DOI10.1016/j.cam.2015.02.055zbMath1329.68207OpenAlexW2087885284MaRDI QIDQ2346635

Heni Bouhamed, Afif Masmoudi, Ahmed Rebai, Thierry Lecroq

Publication date: 2 June 2015

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cam.2015.02.055

zbMATH Keywords

modelingalgorithmic complexityBayesian networkstructure learning

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Learning and adaptive systems in artificial intelligence (68T05)

Uses Software

• BNT
• TETRAD
• ClustOfVar

Cites Work

• On the shortest spanning subtree of a graph and the traveling salesman problem
• Causation, prediction, and search
• A Bayesian method for the induction of probabilistic networks from data
• Learning Bayesian networks: The combination of knowledge and statistical data
• A Sliced Inverse Regression Approach for a Stratified Population
• Approximating discrete probability distributions with dependence trees
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Structure space of Bayesian networks is dramatically reduced by subdividing it in sub-networks