Research on Dynamic Programming Strategy of Bayesian Network Structure Learning

<table class="algorithm-group"><tr><td><table class="algorithm" id="alg1"><tr><td>(1)</td><td>Obtain family scores of all nodes and store them.</td></tr><tr><td>(2)</td><td>Obtain the best parent set and the corresponding score of each and store them.</td></tr><tr><td>(3)</td><td>Obtain the optimal network structure score and the optimal leaf nodes of each node combination and store them.</td></tr><tr><td>(4)</td><td>Construct the network structure.</td></tr></table></td></tr></table>

<div> Execution steps of the BFSDP algorithm.</div>

Scientific Programming

alg1

Algorithm 1

Algorithm 1: Research on Dynamic Programming Strategy of Bayesian Network Structure Learning 