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 - 2008
Externally publishedYes
Event2008 International Conference on Advanced Computer Theory and Engineering, ICACTE 2008 - Phuket, Thailand
Duration: Dec 20 2008Dec 22 2008

Other

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

Fingerprint

Support vector machines

ASJC Scopus subject areas

  • Computational Theory and Mathematics
  • Software

Cite this

Guo, J., Takahashi, N., & Hu, W. (2008). An efficient algorithm for multi-class support vector machines. In Proceedings - 2008 International Conference on Advanced Computer Theory and Engineering, ICACTE 2008 (pp. 327-331). [4736975] https://doi.org/10.1109/ICACTE.2008.48

An efficient algorithm for multi-class support vector machines. / Guo, Jun; Takahashi, Norikazu; Hu, Wenxin.

Proceedings - 2008 International Conference on Advanced Computer Theory and Engineering, ICACTE 2008. 2008. p. 327-331 4736975.

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

Guo, J, Takahashi, N & Hu, W 2008, An efficient algorithm for multi-class support vector machines. in Proceedings - 2008 International Conference on Advanced Computer Theory and Engineering, ICACTE 2008., 4736975, pp. 327-331, 2008 International Conference on Advanced Computer Theory and Engineering, ICACTE 2008, Phuket, Thailand, 12/20/08. https://doi.org/10.1109/ICACTE.2008.48
Guo J, Takahashi N, Hu W. An efficient algorithm for multi-class support vector machines. In Proceedings - 2008 International Conference on Advanced Computer Theory and Engineering, ICACTE 2008. 2008. p. 327-331. 4736975 https://doi.org/10.1109/ICACTE.2008.48
Guo, Jun ; Takahashi, Norikazu ; Hu, Wenxin. / An efficient algorithm for multi-class support vector machines. Proceedings - 2008 International Conference on Advanced Computer Theory and Engineering, ICACTE 2008. 2008. pp. 327-331
@inproceedings{b4b1eda36639429ea81f1d2cefd60189,
title = "An efficient algorithm for multi-class support vector machines",
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.",
author = "Jun Guo and Norikazu Takahashi and Wenxin Hu",
year = "2008",
doi = "10.1109/ICACTE.2008.48",
language = "English",
isbn = "9780769534893",
pages = "327--331",
booktitle = "Proceedings - 2008 International Conference on Advanced Computer Theory and Engineering, ICACTE 2008",

}

TY - GEN

T1 - An efficient algorithm for multi-class support vector machines

AU - Guo, Jun

AU - Takahashi, Norikazu

AU - Hu, Wenxin

PY - 2008

Y1 - 2008

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=62949208053&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=62949208053&partnerID=8YFLogxK

U2 - 10.1109/ICACTE.2008.48

DO - 10.1109/ICACTE.2008.48

M3 - Conference contribution

AN - SCOPUS:62949208053

SN - 9780769534893

SP - 327

EP - 331

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

ER -