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.
This is a preview of subscription content, log in via an institution to check access.
References
Pearl, J.: Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference. Morgan Kaufmann Publishers Inc., San Francisco (1988)
Cooper, G.F.: The computational complexity of probabilistic inference using Bayesian belief networks. Artif. Intell. 42, 393–405 (1990)
Lauritzen, S.L., Spiegelhalter, D.J.: Local computations with probabilities on graphical structures and their application to expert systems. J. Roy. Stat. Soc. Ser. B (Methodol.) 50, 157–224 (1988)
Jensen, F., Lauritzen, S., Olesen, K.: Bayesian updating in causal probabilistic networks by local computations. Computat. Stat. Q. 4, 269–282 (1990)
Shenoy, P.P., Shafer, G.: Axioms for probability and belief-function propagation. In: Uncertainty in Artificial Intelligence. Elsevier, Amsterdam (1990)
Wen, W.: Optimal decomposition of belief networks. In: Proceedings of the Sixth Conference Annual Conference on Uncertainty in Artificial Intelligence (UAI 1990), pp. 245–256. Elsevier Science, New York (1990)
Ottosen, T., Vomlel, J.: All roads lead to rome: new search methods for the optimal triangulation problem. Int. J. Approx. Reason. 53, 1350–1366 (2012)
Cazals, F., Karande, C.: A note on the problem of reporting maximal cliques. Theor. Comput. Sci. 407, 564–568 (2008)
Tomita, E., Tanaka, A., Takahashi, H.: The worst-case time complexity for generating all maximal cliques. In: Chwa, K.-Y., Munro, J.I. (eds.) COCOON 2004. LNCS, vol. 3106, pp. 161–170. Springer, Heidelberg (2004)
Chao, L., Maomi, U.: A depth-first search algorithm for optimal triangulation of Bayesian network. In: Proceedings of the Sixth European Workshop on Probabilistic Graphical Models (2012)
Bodlaender, H.L., Koster, A.M.C.A., van den Eijkhof, F.: Preprocessing rules for triangulation of probabilistic networks. Comput. Intell. 21, 286–305 (2005)
van den Eijkhof, F., Bodlaender, H.L., Koster, A.M.C.A.: Safe reduction rules for weighted treewidth. Algorithmica 47, 139–158 (2007)
Darwiche, A.: Modeling and Reasoning with Bayesian Networks. Cambridge University Press, Cambridge (2009)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Li, C., Ueno, M. (2015). A Fast Clique Maintenance Algorithm for Optimal Triangulation of Bayesian Networks. In: Suzuki, J., Ueno, M. (eds) Advanced Methodologies for Bayesian Networks. AMBN 2015. Lecture Notes in Computer Science(), vol 9505. Springer, Cham. https://doi.org/10.1007/978-3-319-28379-1_11
Download citation
DOI: https://doi.org/10.1007/978-3-319-28379-1_11
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-28378-4
Online ISBN: 978-3-319-28379-1
eBook Packages: Computer ScienceComputer Science (R0)