Large-scale linear nonparallel SVMs

doi:10.1007/s00500-016-2455-9

Large-scale linear nonparallel SVMs

2016-12-19

4

PRE

AI

DOI：10.1007/s00500-016-2455-9

Original

Original request for help

Save

Abstract

En 中文

Large-scale problems have been a very active topic in machine learning area. In the time of big data, it is a challenge and meaningful work to solve such problems. Standard SVM can make linear classification on large-scale problems effectively, with acceptable training time and excellent prediction accuracy. However, nonparallel SVM (NPSVM) and ramp loss nonparallel SVM (RNPSVM) are proposed with better performance than SVM on benchmark datasets. It is motivated to introduce NPSVMs into the area of large-scale issues. In this paper, we propose large-scale linear NPSVMs, solved by the alternating direction method of multipliers (ADMM), to handle large-scale classification problems. ADMM breaks large problems into smaller pieces, avoiding solving intractable problems and leading to higher training speed. The primal problems of NPSVM are convex and differentiable, and they can be managed directly by ADMM. But the objective functions of RNPSVM, composed of convex ones and concave ones, should first be processed by CCCP algorithm and transformed as a series of convex programs. Then, we apply ADMM to solve these programs in every iteration. Experiments of NPSVMs on large-scale problems verify that the algorithms can classify large-scale tasks effectively.

Keywords:

Large-scale

Nonparallel SVM

Ramp loss function

ADMM

Large-scale linear nonparallel SVMs

Abstract

AI Summary

Journal

Organization