Optimal Decomposition of Belief Networks

📝 Original Info

• Title: Optimal Decomposition of Belief Networks
• ArXiv ID: 1304.1111
• Date: 2013-04-05
• Authors: Researchers from original ArXiv paper

📝 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.

💡 Deep Analysis

Deep Dive into Optimal Decomposition of Belief Networks.

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.

📄 Full Content

Reference