Improved Binary Tree Support Vector Machines for Multi-class Classification

被引:0
|
作者
Pan, Yuqi [1 ]
Zheng, Yanwei [1 ]
机构
[1] Univ Jinan, Sch Informat Sci & Engn, Jinan 250022, Peoples R China
关键词
Support Vector Machine; Binary Tree; Muti-class Classification;
D O I
暂无
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
The binary tree SVMs(Support Vector Machines) algorithm for multi-class classification can solve the unclassifiable regions that exist in conventional multi-class SVMs. At present, the most of binary tree SVMs algorithm create a skew binary tree, so the sample training time and the testing speed is slow. In this paper, an improved binary tree SVMs algorithm for multi-class classification is proposed. This algorithm can create a symmetric binary tree and increase training and testing speed. The results of experiment have proved that this algorithm is feasible and effective.
引用
收藏
页码:111 / 116
页数:6
相关论文
共 8 条
  • [1] Bin Hou, 2008, J WUHAN UNIV TECHNOL, P673
  • [2] BOTTOU L, 1994, INT C PATT RECOG, P77, DOI 10.1109/ICPR.1994.576879
  • [3] [郭彦君 GUO Yan-jun], 2009, [现代制造工程, Modern Manufacturing Engineering], P143
  • [4] Kressel UHG, 1999, ADVANCES IN KERNEL METHODS, P255
  • [5] Liu Yang, 2008, COMPUTER ENG DESIGN, P1792
  • [6] Platt JC, 2000, ADV NEUR IN, V12, P547
  • [7] Solbing F S, 2001, LNCS, P283
  • [8] TANG FM, 2005, COMPUTER ENG APPL, P24