ABSTRACT

In order to solve the problem of Bayesian network structure learning, this paper proposes a Bayesian network structure learning problem to solve the problem of adjacency matrix. The adjacency matrix and 1-step dependency coefficient are given, and the adjacency matrix is constructed. The advantage of this method is that the local optimisation ability of the climbing algorithm is applied to the genetic algorithm to fully release the global optimisation ability of the genetic algorithm to achieve the fast convergence of the algorithm. The simulation results show that the algorithm has the effectiveness of the optimisation algorithm.