首页> 外文会议>European Conference on Case-Based Reasoning >An Approach to Aggregating Ensembles of Lazy Learners That Supports Explanation
【24h】

An Approach to Aggregating Ensembles of Lazy Learners That Supports Explanation

机译:汇总支持解释的懒惰学习者的乐谱方法

获取原文

摘要

Ensemble research has shown that the aggregated output of an ensemble of predictors can be more accurate than a single predictor. This is true also for lazy learning systems like Case-Based Reasoning (CBR) and k-Nearest-Neighbour. Aggregation is normally achieved by voting in classification tasks and by averaging in regression tasks. For CBR, this increased accuracy comes at the cost of interpretability however. If we consider the use of retrieved cases for explanation to be one of the advantages of CBR then this is lost in an ensemble. This is because a large number of cases will have been retrieved by the ensemble members. In this paper we present a new technique for aggregation that obtains excellent results and identifies a small number of cases for use in explanation. This new approach might be viewed as a transformation process whereby cases are transformed from their feature based representation to a representation based on the predictions of ensemble members. This new representation produces very accurate predictions and allows a small number of similar neighbours to be identified.
机译:合奏研究表明,预测器的集合输出可以比单个预测器更准确。这也是如此对于懒人学习系统,如基于案例的推理(CBR)和K离最近邻居。通常通过在分类任务中投票和通过在回归任务中平均来实现聚合。对于CBR,这种提高的准确性来自可解释性的成本。如果我们考虑使用检索到的情况,以便解释为CBR的优势之一,那么这在集合中丢失。这是因为整体成员将检索大量情况。在本文中,我们提出了一种用于聚合的新技术,可获得优异的结果,并识别少量用于解释的情况。这种新方法可以被视为转换过程,从而将基于特征的表示转换为基于集合成员的预测的表示。这种新的表示产生非常准确的预测,并允许识别少量类似的邻居。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号