Local Search Methods For Learning Bayesian Networks Using A Modified Neighborhood In The Space Of Dags
IBERAMIA 2002: Proceedings of the 8th Ibero-American Conference on AI: Advances in Artificial Intelligence(2002)
摘要
The dominant approach for learning Bayesian networks from data is based on the use of a scoring metric, that evaluates the fitness of any given candidate network to the data, and a search procedure, that explores the space of possible solutions. The most efficient methods used in this context are (Iterated) Local Search algorithms. These methods use a predefined neighborhood structure that defines the feasible elementary modifications (local changes) that can be applied to a given solution in order to get another, potentially better solution. If the search space is the set of directed acyclic graphs (dags), the usual choices for local changes are arc addition, arc deletion and arc reversal. In this paper we propose a new definition of neighborhood in the dag space, which uses a modified operator for arc reversal. The motivation for this new operator is the observation that local search algorithms experience problems when some arcs are wrongly oriented. We exemplify the general usefulness of our proposal by means of a set of experiments with different metrics and different local search methods, including Hill-Climbing and Greedy Randomized Adaptive Search Procedure (GRASP), as well as using several domain problems.
更多查看译文
关键词
arc reversal,local change,arc addition,arc deletion,different local search method,local search algorithms experience,search procedure,search space,dag space,Greedy Randomized Adaptive Search,Learning Bayesian Networks,Local Search Methods,Modified Neighborhood
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络