Abstract
The junction tree algorithm is currently the most popular algorithm for exact inference on Bayesian networks. To improve the time and space complexity of the junction tree algorithm, we must find an optimal total table size triangulations. For this purpose, Ottosen and Vomlel proposed a depth-first search DFS algorithm for optimal triangulation. They also introduced several techniques for improvement of the DFS algorithm, including dynamic clique maintenance and coalescing map pruning. However, their dynamic clique maintenance might compute some duplicate cliques. In this paper, we propose a new dynamic clique maintenance that only computes the cliques that contain a new edge. The new approach explores less search space and runs faster than the Ottosen and Vomlel method does. Some simulation experiments show that the new dynamic clique maintenance improved the running time of the optimal triangulation algorithm.
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.
