Improved heuristic equivalent search algorithm based on Maximal Information Coefficient for Bayesian Network Structure Learning

• Published in: Neurocomputing (Amsterdam) Vol. 117; pp. 186 - 195
• Main Authors: Zhang, Yinghua, Zhang, Wensheng, Xie, Yuan
• Format: Journal Article
• Language: English
• Published: Amsterdam Elsevier B.V 06.10.2013; Elsevier
• Subjects: Algorithms; Applied sciences; Artificial intelligence; Bayesian network; Computer science; control theory; systems; Exact sciences and technology; Heuristic Search; Information retrieval. Graph; Learning and adaptive systems; Maximal Information Coefficient; Structure learning; Theoretical computing; Maximal Information Coefficient; Structure learning; Heuristic Search; Bayesian network; Standardization; Optimization; Search algorithm; Equivalence classes; Heuristic method; Probabilistic net; Bayes network; Independence test; Graph method; Information structure
• ISSN: 0925-2312; 1872-8286
• DOI: 10.1016/j.neucom.2013.02.015

Greedy Equivalent Search (GES) is an effective algorithm for Bayesian network structure learning problem, which searches in the space of graph equivalence classes. However, original GES which takes greedy strategy into account may easily fall into local optimization trap because of the empty initial structure. In this paper, an improved GES method is proposed. It firstly designs a draft of the real network, based on conditional independence tests and Maximum Information Coefficient, which helps in finding more correct dependent relationship between variables. To ensure correctness, this draft is used as a seed structure of original GES algorithm. Numerical experiments on four standard networks show that SCo (the value of the BDeu score) and NEtoGS (the number of graph structure, which is equivalent to the Gold Standard network) have big improvement. Also, the total of learning time is greatly reduced. Therefore, our improved method can relatively quickly determine the structure with highest degree of data matching.