Dynamic Programming Structure Learning Algorithm of Bayesian Network Integrating MWST and Improved MMPC

Algorithm 1

The pseudocode of S-MMPC.

	Function1
	Input:-Data set,-Target variable,-Significance level
	Output: CPC-Candidate parent-child node set
(1)
(2)	while true//Forward-add nodes to CPC
(3)
(4)	if
(5)
(6)	else
(7)	break
(8)	end if
(9)	end while
(10)	for each variable //Backward-remove nodes from CPC
(11)	if there exists a subset so that
(12)	//If the disjoint sets of and are found in CPC, remove from the CPC
(13)	end if
(14)	end for
(15)	for all
(16)	if
(17)
(18)	end if
(19)	end for
(20)	return
	Function2
	Input:-Target variable, CPC-candidate parent-child node set
	Output: Nodein the greatest association degree withand association degree
(1)
(2)
(3)	return ,