首页> 外文期刊>Neural processing letters >Fast Multiclass SVM Classification Using Decision Tree Based One-Against-All Method
【24h】

Fast Multiclass SVM Classification Using Decision Tree Based One-Against-All Method

机译:基于决策树的全消极方法的快速多类SVM分类

获取原文
获取原文并翻译 | 示例
           

摘要

We present an improved version of One-Against-All (OAA) method for multi-class SVM classification based on a decision tree approach. The proposed decision tree based OAA (DT-OAA) is aimed at increasing the classification speed of OAA by using posterior probability estimates of binary SVM outputs. DT-OAA decreases the average number of binary SVM tests required in testing phase to a greater extent when compared to OAA and other multiclass SVM methods. For a balanced multiclass dataset with K classes, under best situation, DT-OAA requires only (K + l)/2 binary tests on an average as opposed to K binary tests in OAA; however, on unbalanced multiclass datasets we observed DT-OAA to be much faster with proper selection of order in which the binary SVMs are arranged in the decision tree. Computational comparisons on publicly available datasets indicate that the proposed method can achieve almost the same classification accuracy as that of OAA, but is much faster in decision making.
机译:我们提出了一种基于决策树方法的多类支持向量机分类的“全抗(OAA)”方法的改进版本。所提出的基于决策树的OAA(DT-OAA)旨在通过使用二进制SVM输出的后验概率估计来提高OAA的分类速度。与OAA和其他多类SVM方法相比,DT-OAA在很大程度上减少了测试阶段所需的二进制SVM测试平均次数。对于具有K个类的平衡多类数据集,在最佳情况下,与OAA中的K个二进制测试相反,DT-OAA平均仅需要(K + 1)/ 2个二进制测试。但是,在不平衡的多类数据集上,我们观察到正确选择二进制SVM在决策树中排列的顺序,DT-OAA的速度要快得多。对公开数据集的计算比较表明,该方法可以实现与OAA几乎相同的分类精度,但是决策速度要快得多。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号