Optimal Decomposition of Belief Networks
Artificial Intelligence
2013-04-05 v1
Abstract
In this paper, optimum decomposition of belief networks is discussed. Some methods of decomposition are examined and a new method - the method of Minimum Total Number of States (MTNS) - is proposed. The problem of optimum belief network decomposition under our framework, as under all the other frameworks, is shown to be NP-hard. According to the computational complexity analysis, an algorithm of belief network decomposition is proposed in (Wee, 1990a) based on simulated annealing.
Keywords
Cite
@article{arxiv.1304.1111,
title = {Optimal Decomposition of Belief Networks},
author = {Wilson X. Wen},
journal= {arXiv preprint arXiv:1304.1111},
year = {2013}
}
Comments
Appears in Proceedings of the Sixth Conference on Uncertainty in Artificial Intelligence (UAI1990)