An efficient algorithm for multi-class support vector machines

Jun Guo, Norikazu Takahashi, Wenxin Hu

Research output: Chapter in Book/Report/Conference proceedingConference contribution

6 Citations (Scopus)

Abstract

A novel algorithm for multi-class support vector machines (SVMs) is proposed in this paper. The tree constructed in our algorithm consists of a series of two-class SVMs. Considering both separability and balance, in each iteration multi-class patterns are divided into two sets according to the distances between pairwise classes and the number of patterns in each class. This algorithm can well treat with the unequally distributed problems. The efficiency of the proposed method are verified by the experimental results.

Original languageEnglish
Title of host publicationProceedings - 2008 International Conference on Advanced Computer Theory and Engineering, ICACTE 2008
Pages327-331
Number of pages5
DOIs
Publication statusPublished - Dec 1 2008
Externally publishedYes
Event2008 International Conference on Advanced Computer Theory and Engineering, ICACTE 2008 - Phuket, Thailand
Duration: Dec 20 2008Dec 22 2008

Publication series

NameProceedings - 2008 International Conference on Advanced Computer Theory and Engineering, ICACTE 2008

Other

Other2008 International Conference on Advanced Computer Theory and Engineering, ICACTE 2008
CountryThailand
CityPhuket
Period12/20/0812/22/08

ASJC Scopus subject areas

  • Computational Theory and Mathematics
  • Software

Fingerprint Dive into the research topics of 'An efficient algorithm for multi-class support vector machines'. Together they form a unique fingerprint.

Cite this