arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1106.1818cs.AI
收藏

不以准确性换取简单性的可解释投票分类器:理论结果,近似算法

Inducing Interpretable Voting Classifiers without Trading Accuracy for Simplicity: Theoretical Results, Approximation Algorithms

R. Nock

摘要:

投票分类算法研究的最新进展已经带来了经验和理论结果,清楚地表明了集成分类器的识别能力。以前有人认为,这种分类能力的搜索算法的设计已经边缘化的需要,以获得可解释的分类。因此,越来越多的机器学习或数据采掘论文提出了是否必须放弃可解释性以保持分类强度的问题。本文旨在从理论和实证两方面对这一问题进行研究。首先,我们提供了许多结果,深入了解投票分类器的简单性-准确性权衡的难度。然后,我们提供了一个有效的“自顶向下和修剪”归纳启发式,WIDC,主要来自最近的结果弱学习和助推框架。据我们所知,这是第一次尝试使用弱学习框架(以前在决策树归纳方面非常成功的框架)而不是强学习框架(通常用于此类分类器的提升方法)来构建投票分类器作为基础公式。虽然它使用了一个众所周知的归纳方案,以前成功的其他类别的概念表示,从而使其易于实现和比较,WIDC还依赖于最近或新的结果,我们给出的特定情况下的提升称为分区提升和排名损失提升。31个领域的实验结果,其中大部分是现成的,往往显示WIDC产生小,准确,可解释的决策委员会的能力。

英文摘要:

Recent advances in the study of voting classification algorithms have brought empirical and theoretical results clearly showing the discrimination power of ensemble classifiers. It has been previously argued that the search of this classification power in the design of the algorithms has marginalized the need to obtain interpretable classifiers. Therefore, the question of whether one might have to dispense with interpretability in order to keep classification strength is being raised in a growing number of machine learning or data mining papers. The purpose of this paper is to study both theoretically and empirically the problem. First, we provide numerous results giving insight into the hardness of the simplicity-accuracy tradeoff for voting classifiers. Then we provide an efficient "top-down and prune" induction heuristic, WIDC, mainly derived from recent results on the weak learning and boosting frameworks. It is to our knowledge the first attempt to build a voting classifier as a base formula using the weak learning framework (the one which was previously highly successful for decision tree induction), and not the strong learning framework (as usual for such classifiers with boosting-like approaches). While it uses a well-known induction scheme previously successful in other classes of concept representations, thus making it easy to implement and compare, WIDC also relies on recent or new results we give about particular cases of boosting known as partition boosting and ranking loss boosting. Experimental results on thirty-one domains, most of which readily available, tend to display the ability of WIDC to produce small, accurate, and interpretable decision committees.

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

↑