Optimal Decomposition of Belief Networks
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.
Cite
Text
Wen. "Optimal Decomposition of Belief Networks." Conference on Uncertainty in Artificial Intelligence, 1990.Markdown
[Wen. "Optimal Decomposition of Belief Networks." Conference on Uncertainty in Artificial Intelligence, 1990.](https://mlanthology.org/uai/1990/wen1990uai-optimal/)BibTeX
@inproceedings{wen1990uai-optimal,
title = {{Optimal Decomposition of Belief Networks}},
author = {Wen, Wilson X.},
booktitle = {Conference on Uncertainty in Artificial Intelligence},
year = {1990},
pages = {209-224},
url = {https://mlanthology.org/uai/1990/wen1990uai-optimal/}
}