首页> 外文会议>International conference on future computer, control and communication;FCCC 2010 >Optimization of Multi-class SVM Binary Tree based on Binary PSO
【24h】

Optimization of Multi-class SVM Binary Tree based on Binary PSO

机译:基于二进制PSO的多类SVM二叉树的优化

获取原文

摘要

Multi-class SVM classification binary tree has the problem of "error accumulation",the classification error caused by the upper node of the binary tree can't be corrected by the following nodes,this problem reduce the classification accuracy. In order to overcome the "error accumulation " produced by the binary tree of SVM multi-class classification,the binary PSO algorithm (BPSO) was introduced to optimize every node of multi-class SVM classification binary tree by designing particles encoding and fitness function of binary PSO algorithm and building the binary tree during the optimization process. Experiments show that the multi-class SVM classification binary tree optimized by the binary PSO achieves better multi-class classification accuracy,and the binary BPSO reduces the time needed to optimize binary tree.
机译:多类支持向量机分类二叉树存在“错误累积”的问题,由二叉树的上层节点引起的分类错误不能被后续节点纠正,这一问题降低了分类的准确性。为了克服SVM多类分类的二叉树产生的“错误积累”,引入二进制PSO算法(BPSO),通过设计SVM多类分类的粒子编码和适应度函数来优化多类SVM分类二叉树的每个节点。二进制PSO算法,并在优化过程中构建二叉树。实验表明,通过二元PSO优化的多类SVM分类二叉树具有更好的多类分类精度,二元BPSO减少了优化二叉树所需的时间。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号