Uncertainty in Artificial Intelligence
First Name   Last Name   Password   Forgot Password   Log in!
    Proceedings         Authors   Author's Info   Article details         Search    
Optimal Decomposition of Belief Networks
Wilson Wen
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:
Pages: 245-256
PS Link:
PDF Link: /papers/90/p245-wen.pdf
BibTex:
@INPROCEEDINGS{Wen90,
AUTHOR = "Wilson Wen ",
TITLE = "Optimal Decomposition of Belief Networks",
BOOKTITLE = "Proceedings of the Sixth Conference Annual Conference on Uncertainty in Artificial Intelligence (UAI-90)",
PUBLISHER = "AUAI Press",
ADDRESS = "Corvallis, Oregon",
YEAR = "1990",
PAGES = "245--256"
}


hosted by DSL   •   site info   •   help