首页> 外文会议>International Conference on Robots Intelligent System >Construction of Binary Tree Classifier Using Linear SVM for Large-Scale Classification
【24h】

Construction of Binary Tree Classifier Using Linear SVM for Large-Scale Classification

机译:基于线性SVM的二叉树分类器的大规模分类构建

获取原文

摘要

Support vector machines (SVM) with kernel can solve nonlinear problem, but when the size of the problem is relatively large, the solving speed will be slow, which is not conducive to real-time applications. For linear SVM, it has fast computational speed, but its classification accuracy is usually not guaranteed. This paper proposes a binary tree classifier with linear SVM, which makes a tradeoff between computational speed and classification accuracy. If the local error rate is below a pre-set threshold, leaf nodes that make the final decision are generated; Otherwise, recursive construction of non-leaf nodes is performed. The final tree structure expresses the hierarchical division of given pattern classes. Experiments show that the proposed method ensures the generalization ability while responding rapidly.
机译:支持核的支持向量机(SVM)可以解决非线性问题,但是当问题规模较大时,求解速度会很慢,不利于实时应用。对于线性SVM,它具有快速的计算速度,但是通常不能保证其分类精度。本文提出了一种具有线性支持向量机的二叉树分类器,它在计算速度和分类精度之间进行了权衡。如果本地错误率低于预设阈值,则生成做出最终决策的叶节点;否则,将生成最终决策的叶节点。否则,将执行非叶节点的递归构造。最终的树形结构表示给定模式类别的层次划分。实验表明,该方法在快速响应的同时,保证了泛化能力。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号