arXivDaily arXiv每日学术速递 周一至周五更新
arXiv cs/0509055cs.LG
收藏

学习最优增强贝叶斯网络

Learning Optimal Augmented Bayes Networks

Vikas Hamine, Paul Helman

摘要:

朴素贝叶斯是一种简单的贝叶斯分类器,具有很强的属性独立性假设。该分类器具有较强的独立性假设,在实际应用中表现良好。相信放松朴素贝叶斯分类器的独立性假设可以提高所得结构的分类精度。虽然寻找最佳无约束贝叶斯网络(对于大多数合理的评分措施)是NP难问题,但可以在多项式时间内学习遵守各种结构限制的最佳网络。一些作者已经研究了在朴素贝叶斯分类器的属性之间添加增强弧的可能性。Friedman、Geiger和Goldszynst定义了TAN结构,其中增广弧在属性上形成树,并提出了一个多项式时间算法,该算法学习相对于MDL分数的最优TAN。Keogh和Pazzani定义了增强贝叶斯网络,其中增强弧在属性上形成森林(树的集合,因此放松了TAN的结构限制),并提出了启发式搜索方法来学习好的,但不是最优的,增强弧集。然而,作者仅根据观察到的误分类错误来评估学习的结构,而不是针对评分指标,如MDL。在本文中,我们提出了一个简单的,多项式时间的贪心算法学习最佳的增强贝叶斯网络的MDL得分。

英文摘要:

Naive Bayes is a simple Bayesian classifier with strong independence assumptions among the attributes. This classifier, desipte its strong independence assumptions, often performs well in practice. It is believed that relaxing the independence assumptions of a naive Bayes classifier may improve the classification accuracy of the resulting structure. While finding an optimal unconstrained Bayesian Network (for most any reasonable scoring measure) is an NP-hard problem, it is possible to learn in polynomial time optimal networks obeying various structural restrictions. Several authors have examined the possibilities of adding augmenting arcs between attributes of a Naive Bayes classifier. Friedman, Geiger and Goldszmidt define the TAN structure in which the augmenting arcs form a tree on the attributes, and present a polynomial time algorithm that learns an optimal TAN with respect to MDL score. Keogh and Pazzani define Augmented Bayes Networks in which the augmenting arcs form a forest on the attributes (a collection of trees, hence a relaxation of the stuctural restriction of TAN), and present heuristic search methods for learning good, though not optimal, augmenting arc sets. The authors, however, evaluate the learned structure only in terms of observed misclassification error and not against a scoring metric, such as MDL. In this paper, we present a simple, polynomial time greedy algorithm for learning an optimal Augmented Bayes Network with respect to MDL score.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑