首页> 外文会议>International conference on artificial intelligence and soft computing >Pruning One-Class Classifier Ensembles by Combining Sphere Intersection and Consistency Measures
【24h】

Pruning One-Class Classifier Ensembles by Combining Sphere Intersection and Consistency Measures

机译:结合球面相交和一致性度量来修剪一类分类器集合

获取原文

摘要

One-class classification is considered as one of the most challenging topics in the contemporary machine learning. Creating Multiple Classifier Systems for this task has proven itself as a promising research direction. Here arises a problem on how to select valuable members to the committee - so far a largely unexplored area in one-class classification. This paper introduces a novel approach that allows to choose appropriate models to the committee in such a way that assures both high quality of individual classifiers and a high diversity among the pool members. We aim at preventing the selection of both too weak or too similar models. This is achieved with the usage of an multi-objective optimization that allows to consider several criteria when searching for a good subset of classifiers. A memetic algorithm is applied due to its efficiency and less random behavior than traditional genetic algorithm. As one-class classification differs from traditional multi-class problems we propose to use two measures suitable for this problem - consistency measure that allow to rank the quality of one-class models and introduced by us sphere intersection measure that serves as a diversity metric. Experimental results carried on a number of benchmark datasets proves that it outperforms traditional single-objective approaches.
机译:一类分类被认为是当代机器学习中最具挑战性的主题之一。为此任务创建多个分类器系统已被证明是一个有前途的研究方向。这就产生了一个关于如何选择委员会有价值成员的问题-到目前为止,这是一类分类中一个尚未开发的领域。本文介绍了一种新颖的方法,该方法可以确保向委员会选择合适的模型,从而既可以确保单个分类器的高质量,又可以确保池成员之间的多样性。我们旨在防止选择太弱或太相似的模型。这是通过使用多目标优化来实现的,该优化允许在搜索分类器的良好子集时考虑多个条件。与传统的遗传算法相比,应用了模因算法,是因为其效率高,随机行为少。由于一类分类不同于传统的多类问题,因此我们建议使用两种适用于此问题的度量-一致性度量(允许对一类模型的质量进行排名),并由我们采用球面相交度量作为多样性度量。在许多基准数据集上进行的实验结果证明,它优于传统的单目标方法。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号