首页> 外文会议>Asia-Pacific Conference on Information Processing >An Improved Binary Tree SVM Classification Algorithm Based on Bayesian
【24h】

An Improved Binary Tree SVM Classification Algorithm Based on Bayesian

机译:基于贝叶斯的改进的二叉树SVM分类算法

获取原文

摘要

Due to the great generalization and the support of statistics, support vector machines (SVMs) has been widely applied to resolving multi-class classification problem. Numbers of multi-class SVM have been proposed. Compared with other multi-class SVM, binary tree of SVM (BTS) takes a good advantage of lower time consuming. However, there is some unnecessary data reassignment during constructing a binary tree, which makes BTS can't resolve the high-dimensional multi-class classification problem accurately. In this paper, a bayesian-based BTS classification algorithm (b-BTS) has been proposed. Experiments demonstrated that b-BTS is superior to BTS in resolving classification problem, such as image classification problem.
机译:由于概括和统计数据的支持,支持向量机(SVM)已被广泛应用于解决多级分类问题。已经提出了多级SVM数量。与其他多级SVM相比,SVM(BTS)的二叉树采取较低耗时的优势。然而,在构造二叉树期间存在一些不必要的数据重新分配,这使得BTS无法准确地解析高维多级分类问题。本文提出了一种基于贝叶斯的BTS分类算法(B-BTS)。实验证明,B-BTS在解决分类问题中优于BTS,例如图像分类问题。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号