Research on Dynamic Programming Strategy of Bayesian Network Structure Learning

Table 1

The CPS and NFS of the Asia network and those needed to be considered with and without priors in DP.

Node	Standard		Without priors		With priors
	CPS	NFS	CPS	NFS	CPS	NFS
1	{X2, X3}	4	{X \X1}	128	{X2, X3}	4
2	{X1, X7}	4	{X \X2}	128	{X1, X7}	4
3	{X1, X6}	4	{X \X3}	128	{X1, X6, X8}	8
4	{X5}	2	{X \X4}	128	{X5}	2
5	{X4, X6}	4	{X \X5}	128	{X4, X6, X8}	8
6	{X3, X5, X7, X8}	16	{X \X6}	128	{X3, X5, X8}	8
7	{X2, X6}	4	{X \X7}	128	{X2}	2
8	{X6}	2	{X \X8}	128	{X3, X5, X6}	8