A new boosting multi-class SVM algorithm


Prasad Singh, Yashwant and Chamasemani, Fereshteh Falah (2013) A new boosting multi-class SVM algorithm. International Journal of Advanced Research in Computer Science, 4 (2). pp. 1-6. ISSN 0976-5697

[img] Text
A New Boosting Multi-class SVM Algorithm.pdf
Restricted to Repository staff only

Download (289kB)


Support Vector Machines (SVM) have originally designed for binary classification problems. However, Multi-class SVMs (MCSVM) are implemented by combining several binary SVMs. This paper presents a new boosting Multi-class SVMs (BmSVM) to overcome computational complexity of existing construction MCSVM methods. The other two objectives of the paper are: first, to show the robustness of BmSVM against different constructing Multi-class SVM methods such as One-Against-All, One-Against-One; Second, to compare the performance and complexity of BmSVM against SMO, AdaBoost, Decision Tree, and MCSVM. The simulation results demonstrate that the BmSVM on hypothyroid dataset with polynomial kernel is superior to the others.

Item Type: Article
Subjects: Q Science > QA Mathematics > QA71-90 Instruments and machines > QA75.5-76.95 Electronic computers. Computer science
Divisions: Faculty of Computing and Informatics (FCI)
Depositing User: Ms Suzilawati Abu Samah
Date Deposited: 20 Feb 2014 03:01
Last Modified: 20 Feb 2014 03:01
URII: http://shdl.mmu.edu.my/id/eprint/5306


Downloads per month over past year

View ItemEdit (login required)