期刊文献+

一种新的基于SVM的多层分类方法 被引量:1

An Improved SVM-Based Multi-Level Classification Method
下载PDF
导出
摘要 本文提出了一种新的基于SVM多类问题的策略Half-Against-Half,用该方法训练的基本思想是从多个类别中选择相近或相似的类别,相近的类别放在一个子集里,把多个类别分成两个子集,一直递归地使用这种思想,用类似决策树的思想构造,直到通过多个二分SVM分类器能把每个类别分开。从理论上看,该方法在训练时间、速度、训练集大小等方面比传统的方法OVA、OVO、DAG有一定的优势,并在实践方面得到了实验数据的支持。 A Half-Against-Half (HAH) multi-class SVM is proposed in this paper. HAH is built via recursively dividing the training dataset of K classes into two subsets of classes. The structure of HAH is the same as a decision tree with each node as a binary SVM classifier that tells a testing sample to belong to a certain group of classes. Unlike the commonly used One-Agalnst-All (OVA) and One-Against-One (OVO) implementation methods, both the theoretical estimation and experimental results show that HAH is superior to OVA,OVO and DAG, and is supported by the experimental data in practice, especially in the training time, speed, and training set sizes.
出处 《计算机工程与科学》 CSCD 2007年第4期108-110,共3页 Computer Engineering & Science
基金 湖北省科技攻关计划资助项目(2003BDSP004)
关键词 支持向量机 多层分类 Half-Against-Half SVM(support vector machine) multi-level classification Half-Against-Half
  • 相关文献

参考文献5

  • 1Pang Shaoning,Constructing SVM Multiple Tree for Face Membership Authentication[A].Proc of ICBA'04[C].2004.37-43.
  • 2Lei Hansheng,Venu Govindaraju,Qza Nikunj C,et al.Half-Against-Half Multi-class Support Vector Machines[A].Proc of MCS'05[C].2005.156-164.
  • 3Liu X,Xing H,Wang X.A Multistage Support Vector Machine[A].Proc of the 2nd Int'l Conf on Machine Learning and Cybernetics[C].2003.1305-1308.
  • 4Pang Shaoning,Kim D,Bang S Y.Face Membership Authentication Using SVM Classification Tree Generated by Membership-Based LLE Data Partition[J].IEEE Trans on Neural Network,2005,16(2):436-446.
  • 5Pang Shaoning,Ozawa S,Kasabov N.Incremental Linear Discriminant Analysis for Classification of Data Streams[J].IEEE Trans on System,Man,and Cybernetics-Part B,2005,35(5):905-914.

同被引文献11

引证文献1

二级引证文献4

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部