Mixed-norm linear support vector machine
- First Online:
- Cite this article as:
- Zhang, C., Shao, Y., Tan, J. et al. Neural Comput & Applic (2013) 23: 2159. doi:10.1007/s00521-012-1166-0
- 352 Downloads
This paper presents a new version of support vector machine (SVM) named l2 − lp SVM (0 < p < 1) which introduces the lp-norm (0 < p < 1) of the normal vector of the decision plane in the standard linear SVM. To solve the nonconvex optimization problem in our model, an efficient algorithm is proposed using the constrained concave–convex procedure. Experiments with artificial data and real data demonstrate that our method is more effective than some popular methods in selecting relevant features and improving classification accuracy.