Research Article
Upper-Lower Bounds Candidate Sets Searching Algorithm for Bayesian Network Structure Learning
(1) Input: Data set D; Variable set ; ; , where ; | (2) If and | (3) Orient and delete in , | (4) Else if and , then | (5) Orient and delete in , | (6) End if; | (7) Output . |
|