Bayesian network variable elimination method optimal elimination order construction

Variable Elimination (VE) is the most basic one of many Bayesian network inference algorithms. The speed and complexity of reasoning mainly depend on the order of elimination. Finding the optimal elimination order is a Nondeterministic Polynomial Hard (NP-Hard) problem, which is often solved by heuristic search in practice. In order to improve the speed of reasoning of the variable elimination method, the minimum, maximum potential, minimum missing edge and minimum added complexity search methods are studied. The Asian network is taken as an example to analyze and calculate the complexity and elimination of the above search method. Meta-order, through MATLAB R2018a, the above different search methods were constructed and reasoned separately. Finally, the performance of the four search methods was compared by inference time analysis. The experimental results show that the minimum increase complexity search method is better than other search methods, and the average time consuming is at least 0.012s, which can speed up the reasoning process of Bayesian network