Abstract
In this paper, A new method of learning Bayesian network is presented. This method Improves the popular Markov Chain Monte Carlo (MC) method for structural learning in graphical models. In the improved learning algorithm, mutual information is used to determine the conditional independence of two variables. The Bayesian network obtained by this approach is considered as the the initial status in the Markov Chain. Using the network operators(adding, deleting and conversing), we can get a new Bayesian network which looked as a new status of the Markov Chain. Iterating this new algorithm for given times, the latest status of the Markov Chain is obtain used as the Bayesian network structure. The result of the experiment shows that convergence velocity of the improved MC3 algorithm is faster than the ordinary MC3 algorithmpsilas, and the Bayesian network structures learned by two algorithm are similarly.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
