Abstract
By promoting the parallel hyperplanes to non-parallel ones in SVM, twin support vector machines (TWSVM) have attracted more attention. There are many modifications of them. However, most of the modifications minimize the loss function subject to the I 2-norm or I 1-norm penalty. These methods are non-adaptive since their penalty forms are fixed and pre-determined for any types of data. To overcome the above shortcoming, we propose l p norm least square twin support vector machine (l p LSTSVM). Our new model is an adaptive learning procedure with l p -norm (0<p<1), where p is viewed as an adjustable parameter and can be automatically chosen by data. By adjusting the parameter p, l p LSTSVM can not only select relevant features but also improve the classification accuracy. The solutions of the optimization problems in l p LSTSVM are obtained by solving a series systems of linear equations (LEs) and the lower bounds of the solution is established which is extremely helpful for feature selection. Experiments carried out on several standard UCI data sets and synthetic data sets show the feasibility and effectiveness of the proposed method.
Similar content being viewed by others
Notes
Sparsity is here defined as the number of nonzero components in the normal vector w 1. This means that more zero components in w 1, more sparse the hyperplane.
References
Mangasarian O, Wild E (2006) Multisurface proximal support vector classification via generalized eigenvalues. IEEE Trans Pattern Anal Mach Intell 28(1):69–74
Jayadeva R, Khemchandani S, Chandra S (2007) Twin support vector machines for pattern classification. IEEE Trans Pattern Anal Mach Intell 29(5):905–910
Kumar MA, Gopal M (2008) Application of smoothing technique on twin support vector machines. Pattern Recog Lett 29(13):1842–1848
Kumar MA, Gopal M (2009) Least squares twin support vector machines for pattern classification. Expert Syst Appl 36(4):7535–7543
Jayadeva R, Khemchandani S, Chandra S (2009) Optimal kernel selection in twin support vector machines. Optim Lett 3(1):77–88
Ghorai S, Mukherjee A, Dutta PK (2009) Nonparallel plane proximal classifier. Signal Process 89(4):510–522
Shao YH, Zhang CH, Wang XB, Deng NY (2011) Improvements on twin support vector machines. IEEE Trans Neural Netw 22(6):962–968
Shao YH, Wang Z, Chen WJ, Deng NY (2013) Least squares twin parametric-margin support vector machines for classification. Appl Intell 39(3):451–464
Chen W-J, Shao YH, Xu DK, Fu YF (2014) Manifold proximal support vector machine for semi-supervised classification. Appl Intell 40(4):623–638
Xu YT, Guo R (2014) An improved ν-twin support vector machine. Appl Intell 41:42–54
Xu YT, Wang LS (2014) K-nearest neighbor-based weighted twin support vector regression. Appl Intell 41:299–309
Gao SB, Ye QL, Ye N (2011) 1-norm least squares twin support vector machine. Neurocomputing 74:3590–3597
Chen W J, Tian Y J (2010) L p -norm proximal support vector machine and its applications. Procedia Comput Sci ICCS 1(1):2417–2423
Tian YJ, Yu J, Chen WJ (2010) l p -norm support vector machine with CCCP. In: Proc. the 7th FSKD, pp 1560-1564
Tan J Y, Zhang C H, Deng N Y (2010) Cancer related gene identification via p-norm support vector machine. In: The 4th international conference on computational systems biology, pp 101–108
Tan J-Y, Zhang Z.-Q, Zhen L., Zhang C-H, Deng N-Y (2013) Adaptive feature selection via a new version of support vector machine. Neural Comput Appl 23:937–945
Zhang C-H, Shao Y-H, Tan J-Y, Deng N-Y (2013) A mixed-norm linear support vector machine. Neural Comput Appl 23:2159–2166
Chen XJ, Xu FM, Ye YY (2009) Lower bound theory of nonzero entries in solutions of l 2- l p minimization. http://www.polyu.edu.hk/ama/staff/xjchen/cxyfinal.pdf
Bruckstein A M, Donoho D L, Elad M (2009) From sparse sulutions of systems of equations to sparse modeling of signals and images. SIAM Rev 51:34–81
Fan J, Li R (2001) Varible selection via nonconcave penalized likelihood and its oracle properties. J Amer Statis Assoc 96:1348–1360
Xu Z, Zhang H, Wang Y, Chang X (2009) \(L_{\frac {1}{2}}\) regularizer. Sci Chin Series F-InfSci 52:1–9
Saad Y (2003) Iterative methods for sparse linear systems. SIAM Press, Philadelphia
Acknowledgment
We thank the anonymous reviewers for their valuable suggestions. This paper is supported by National Natural Science Foundation of China (No. 11301535, No. 11371365)
Author information
Authors and Affiliations
Corresponding author
Additional information
This paper is supported by the National Natural Science Foundation of China (Grant No. 11301535, 11371365)
Rights and permissions
About this article
Cite this article
Zhang, Z., Zhen, L., Deng, N. et al. Sparse least square twin support vector machine with adaptive norm. Appl Intell 41, 1097–1107 (2014). https://doi.org/10.1007/s10489-014-0586-1
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10489-014-0586-1