Triangulation of Moral Graph Using Bayesian Optimization Algorithm
نویسندگان
چکیده
Finding the optimistic triangulation in Bayesian network, is NP hard. Bayesian Optimization Algorithm is a new kind of evolutionary algorithm estimation of distribution algorithms (EDAs). An improved BOA is proposed to get approximate optimistic triangulation in this paper. We carry out four EDAs including our method, on four standard Bayesian networks. Comparing with other Estimation of distribution algorithms, our method displays better experimental results and robustness.
منابع مشابه
Maximal Prime Subgraph Decomposition of Bayesian Networks
The authors present a method for decomposition of Bayesian networks into their maximal prime subgraphs. The correctness of the method is proven and results relating the maximal prime subgraph decomposition (MPD) to the maximal complete subgraphs of the moral graph of the original Bayesian network are presented. The maximal prime subgraphs of a Bayesian network can be organized as a tree which c...
متن کاملDecomposing Bayesian networks: triangulation of the moral graph with genetic algorithms
In this paper we consider the optimal decomposition of Bayesian networks. More concretely, we examine { empirically {, the applicability of genetic algorithms to the problem of the triangulation of moral graphs. This problem constitutes the only di cult step in the evidence propagation algorithm of Lauritzen and Spiegelhalter (1988) and is known to be NP-hard (Wen, 1991). We carry out experimen...
متن کاملBelief updating in Bayesian networks by using a criterion of minimum time
Variable elimination (VE) and clustering algorithms (CAs) are two widely used algorithms for exact inference in Bayesian networks. Both the problem of finding an optimal variable elimination ordering in VE and the problem of finding an optimal graph triangulation in CAs are NP-complete, although greedy algorithms work well in practice. Usually, VE selects the next variable to be eliminated such...
متن کاملAn Evolutionary Algorithm for Bayesian Network Triangulation
The problem of triangulation (decomposition) of Bayesian networks is considered. Triangularity of a Bayesian network is required in a general evidence propagation scheme on this network. Finding an optimal triangulation is NP-hard. A local search heuristic based on the idea of evolutionary algorithms is presented. The results obtained using existing and proposed approaches are compared on a bas...
متن کاملLearning Bayesian Network Structure using Markov Blanket in K2 Algorithm
A Bayesian network is a graphical model that represents a set of random variables and their causal relationship via a Directed Acyclic Graph (DAG). There are basically two methods used for learning Bayesian network: parameter-learning and structure-learning. One of the most effective structure-learning methods is K2 algorithm. Because the performance of the K2 algorithm depends on node...
متن کامل