期刊
NEUROCOMPUTING
卷 128, 期 -, 页码 507-516出版社
ELSEVIER
DOI: 10.1016/j.neucom.2013.08.009
关键词
Machine learning; Classification; Convex quadratic programming; SVM; ELM; Randomization
资金
- China Scholarship Council (CSC)
- China Postdoctoral Science Foundation [2012M520624]
- National Science Foundation for Young Scientists of China [61305075]
This paper presents how commonly used machine learning classifiers can be analyzed using a common framework of convex optimization. Four classifier models, the Support Vector Machine (SVM), the Least-Squares SVM (LSSVM), the Extreme Learning Machine (ELM), and the Margin Loss ELM (MLELM) are discussed to demonstrate how specific parametrizations of a general problem statement affect the classifier design and performance, and how ideas from the four different classifiers can be mixed and used together. Furthermore, 21 public domain benchmark datasets are used to experimentally evaluate five performance metrics of each model and corroborate the theoretical analysis. Comparison of classification accuracies under a nested cross-validation evaluation shows that with an exception all four models perform similarly on the evaluated datasets. However, the four classifiers command different amounts of computational resources for both testing and training. These requirements are directly linked to their formulations as different convex optimization problems. (C) 2013 Elsevier B.V. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据