Abstract
This paper presents a new version of support vector machine (SVM) named l 2 − l p SVM (0 < p < 1) which introduces the l p -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.
Similar content being viewed by others
References
Vapnik VN (1998) Statistical learning theory. Wiley, New York
Deng NY, Tian YJ, Zhang CH (2012) Suppport vector machines: optimization based theory, algorithms and applications. CRC press, Boca Raton (in press)
Guyon I, Weston J, Barnhill S, Vapnik VN (2002) Gene selection for cancer classification using support vector machines. Mach Learn 46:389–422
Mangasarian OL (1997) Minimum-support solutions of polyhedral concave programs, Technical Report Tr-1997-05, Mathematical Programming, University of Wisconsin
Zhu J, Rosset S, Hastie T, Tibshirani R (2003) 1-norm support vector machines. Adv Neural Inf Process Syst 16:49-56
Bradley PS, Mangasarian OL (1998) Feature selection via concave minimization and support vector machines. In: Proceedings of the 13th ICML, pp 82–90
Mangasarian OL, Wild EW (2007) Feature selection for nonlinear kernel support vector machines. In: IEEE seventh international conference on data mining, pp 231–236
Chen XJ, Xu FM, Ye YY (2009) Lower bound theory of nonzero entries in solutions of l 2-l p minimization. http://www.standardford.edu/yyye/
Bruckstein AM, Donoho DL, 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 Am Stat Assoc 96:1348–1360
Xu Z, Zhang H, Wang Y, Chang X (2009) L1/2 regularizer. Sci Chin Ser F-Inf Sci 52:1–9
Tan JY, Zhang CH, etc. (2010) Cancer Related Gene Identification via p-norm support vector machine. In: The international conference on computational systems biology, pp 101–108
Zhang CH, Tan JY et al (2010) Feature Selection in multi-instance learning. In: The international symposium on operations research and its Applications: 462-469
Tan JY, Zhang ZQ, Zhen L, Zhang CH, Deng NY (2012) Adaptive feature selection via a new version of support vector machine. Neural Comput Appl. doi:10.1007/s00521-012-1018-y
Chen WJ, Tian YJ (2010) l p -norm proximal support vector machine and its application. Proc Comput Sci ICCS 1(1):2411-2417
Yuille AL, Rangarijan (2003) The concave-convex procedure. Neural Comput 15:915–936
Smola AJ, Vishwanathan SVN, Hofman T (2005) Kernel methods for missing variables. In: Proceedings of the tenth international workshop on artificial intelligence and statistics, Barbodos
Singh D, Febbo P, Ross K, Jackson D, Manola J, Ladd C, Tamayo P, Renshaw A, D’Amico A, Richie J, Lander E, Loda M, Kantoff P, Golub T, Sellers W (2002) Gene expression correlates of clinical prostate cancer behavior. Cancer Cell 1:203–209
Golub TR, Slonim DK, Tamayo P, Huard C, Gaasenbeek M, Mesirov JP, Coller H, Loh ML, Downing JR, Caligiuri MA, Bloomfield CD, Lander ES (1999) Molecular classification of cancer: class discovery and class prediction by gene expression monitoring. Science 286:531–537
Acknowledgments
This work is supported by Chinese Universities Scientific Fund (No. 2011JS039), the Zhejiang Provincial Natural Science Foundation of China (No. LQ12A01020) and the National Natural Science Foundation of China (Nos. 10971223, 11201480, 11201426).
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Zhang, C., Shao, Y., Tan, J. et al. Mixed-norm linear support vector machine. Neural Comput & Applic 23, 2159–2166 (2013). https://doi.org/10.1007/s00521-012-1166-0
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00521-012-1166-0