首页> 外文会议>ICMLA 2012;International Conference on Machine Learning and Applications >Analyzing the Performance of Hierarchical Binary Classifiers for Multi-class Classification Problem Using Biological Data
【24h】

Analyzing the Performance of Hierarchical Binary Classifiers for Multi-class Classification Problem Using Biological Data

机译:使用生物数据分析多分类问题的分级二元分类器的性能

获取原文

摘要

Multi-class classification problem has become a challenging problem in bioinformatics research. The problem becomes more difficult as the number of classes increases. Decomposing the problem into a set of binary problems can be a good solution in some cases. One of the popular approaches is to build a hierarchical tree structure where a binary classifier is used at each node of the tree. This paper proposes a new greedy technique for building a hierarchical binary classifier to solve multiclass problem. We use neural networks to build all possible binary classifiers and use this greedy strategy to build the hierarchical tree. This technique is evaluated and compared with two popular standard approaches One-Versus-All, One-Versus-One and a multi-class single neural network based classifier. In addition, these techniques are compared with an exhaustive approach that utilizes all possible binary classifiers to analyze how close those classifiers perform to the exhaustive method.
机译:多类别分类问题已经成为生物信息学研究中的一个具有挑战性的问题。随着班级数量的增加,这个问题变得更加困难。在某些情况下,将问题分解为一组二元问题可能是一个很好的解决方案。一种流行的方法是构建分层树结构,其中在树的每个节点上使用二进制分类器。本文提出了一种新的贪婪技术,用于构建用于解决多类问题的分层二进制分类器。我们使用神经网络来构建所有可能的二进制分类器,并使用这种贪婪策略来构建分层树。对该技术进行了评估,并与两种流行的标准方法One-Versus-All,One-Versus-One和基于多类单神经网络的分类器进行了比较。另外,将这些技术与穷举方法进行比较,穷举方法利用所有可能的二进制分类器来分析那些分类器与穷举方法的接近程度。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号