Study of Heuristic Search and Exhaustive Search in Search Algorithms of the Structural Learning
Hui Liu, Cao Yonghui · 2010
Structural learning can be accomplished by utilizing a search algorithm over the possible network structures, because it is finding the best network that fits the available data and is optimally complex. In this paper, a greater importance is given to the search algorithm because we have assumed that the data will be complete. We focus on Two search algorithms are introduced to learn the structure of a Bayesian network in the paper. The heuristic search algorithm is simple and explores a limited number of network structures. On the other hand, the exhaustive search algorithm is complex and explores many possible network structures.