Abstract
In this paper, the techniques for learning and approximate inference of dynamic Bayesian networks (DBNs) are studied. With respect to the structure learning of DBNs, the EM-EA algorithm is introduced into the learning process of DBNs and the flow of learning DBNs is given out in the presence of the incomplete data and hidden variables. As for the DBNs inference, the difficulties are analyzed that apply directly the standard inference techniques to DBNs. Furthermore, two improved algorithms of likelihood weighting (LW) algorithm, ER algorithm and SOF algorithm are introduced and assembled. The experimental results show that these algorithms can effectively overcome the disadvantages of the LW algorithm, and especially, the assembled algorithm gives a outstanding performance.
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.
