关于学习信度网络中的单链接搜索的评论
Critical Remarks on Single Link Search in Learning Belief Networks
摘要:
在信度网络的学习中,为了减小搜索空间,人们广泛采用单链接前向搜索。我们发现,存在一类概率领域模型,它显示了一个特殊的依赖模式。我们使用不同的评分指标(例如熵、条件独立性、最小描述长度和贝叶斯指标)分析了几种学习算法的行为。我们证明,单链路前瞻搜索程序(在这些算法中使用)不能正确地学习这些模型。因此,当基础领域模型实际上属于这个类时,使用单个链接搜索过程将导致学习到不正确的模型。这可能会导致使用模型时出现推断错误。我们的分析表明,如果关于一个域的先验知识不排除这些模型的可能存在,多链接前瞻搜索或其他算法应用于学习过程。
英文摘要:
In learning belief networks, the single link lookahead search is widely adopted to reduce the search space. We show that there exists a class of probabilistic domain models which displays a special pattern of dependency. We analyze the behavior of several learning algorithms using different scoring metrics such as the entropy, conditional independence, minimal description length and Bayesian metrics. We demonstrate that single link lookahead search procedures (employed in these algorithms) cannot learn these models correctly. Thus, when the underlying domain model actually belongs to this class, the use of a single link search procedure will result in learning of an incorrect model. This may lead to inference errors when the model is used. Our analysis suggests that if the prior knowledge about a domain does not rule out the possible existence of these models, a multi-link lookahead search or other heuristics should be used for the learning process.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。