Solving large-scale multiclass learning problems via an efficient support vector classifier
Lists
Only you see this
Abstract
Support vector machines (SVMs) are initially designed for binary classification. How to effectively extend them for multiclass classification is still an ongoing research topic. A multiclass classifier is constructed by combining SVM <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">light</sup> algorithm with directed acyclic graph SVM (DAGSVM) method, named DAGSVM <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">light</sup> A new method is proposed to select the working set which is identical to the working set selected by SVM <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">light</sup> approach. Experimental results indicate DAGSVM <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">light</sup> is competitive with DAGSMO. It is more suitable for practice use. It may be an especially useful tool for large-scale multiclass classification problems and lead to more widespread use of SVMs in the engineering community due to its good performance.
BibTeX
@article{zheng2006solving,
author = {Shuibo Zheng and Houjun Tang and Zhengzhi Han and Haoran Zhang},
title = {{Solving large-scale multiclass learning problems via an efficient support vector classifier}},
journal = {Journal of Systems Engineering and Electronics},
year = {2006},
doi = {10.1016/s1004-4132(07)60036-x},
}Loading related content...