.png){kind=icon}
.png){kind=icon}
Return
Linear programming ν-nonparallel support vector machine and its application in vehicle recognition
.png){kind=icon}
PRE
AI
DOI：10.1016/j.neucom.2015.07.159.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this paper, based on the nonparallel hyperplane classifier, nu-nonparallel support vector machine (nu-NPSVM), we proposed its linear programming formulation, termed as nu-LPNPSVM. nu-NPSVM which has been proved superior to the twin support vector machines (TWSVMs), is parameterized by the quantity nu to let ones effectively control the number of support vectors. Compared with the quadratic programming problem of nu-NPSVM, the 1-norm regularization term is introduced to nu-LPNPSVM to make it to be linear programming problem which can be solved fastly and easily. We also introduce kernel functions directly into the formulation for the nonlinear case. The numerical experiments on lots of data sets verify that our nu-LPNPSVM is superior to TWSVMs and faster than standard NPSVMs. We also apply this new method to the vehicle recognition problem and justify its efficiency. (C) 2016 Elsevier B.V. All rights reserved.
Keywords:
Classification
Support vector machine
Vehicle recognition
Nonparallel
Linear programming
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.