A Comparison of Methods for Multiclass Support Vector Machines
摘要:
Support vector machines (SVMs) were originally designed for binary classification. How to effectively extend it for multiclass classification is still an ongoing research issue. Several methods have been proposed where typically we construct a multiclass classifier by combining several binary classifiers. Some authors also proposed methods that consider all classes at once. As it is computationally more expensive to solve multiclass problems, comparisons of these methods using large-scale problems have not been seriously conducted. Especially for methods solving multiclass SVM in one step, a much larger optimization problem is required so up to now experiments are limited to small data sets. In this paper we give decomposition implementations for two such "all-together" methods. We then compare their performance with three methods based on binary classifications: "one-against-all," "one-against-one," and directed acyclic graph SVM (DAGSVM). Our experiments indicate that the "one-against-one" and DAG methods are more suitable for practical use than the other methods. Results also show that for large problems methods by considering all data at once in general need fewer support vectors
展开
DOI:
10.1109/72.991427
被引量:
年份:
2002



































































通过文献互助平台发起求助,成功后即可免费获取论文全文。
相似文献
参考文献
引证文献
来源期刊
引用走势
辅助模式
引用
文献可以批量引用啦~
欢迎点我试用!