Abstract
In this paper, we study a smoothing support vector machine (SVM) by using exact penalty function. First, we formulate the optimization problem of SVM as an unconstrained and nonsmooth optimization problem via exact penalty function. Second, we propose a two-order differentiable function to approximately smooth the exact penalty function, and get an unconstrained and smooth optimization problem. Third, by error analysis, we can get approximate solution of SVM by solving its approximately smooth penalty optimization problem without constraint. Compared with artificial neural network and time sequence, the precision of prediction of our smoothing SVM which is illustrated with the numerical experiment is better.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Burges, C.J.C.: A tutorial on support vector machines for pattern recognition. Data Mining and Knowledge Discovery 2, 121–167 (1998)
Lee, K.L., Billings, S.A.: Time series prediction using support vector machines, the orthogonal and the regularized orthogonal least-squares algorithms. International Journal of Systems Science 33, 811–811 (2002)
Yuh-Jye Lee, E., Mangasarin, O.L.: SSVM: A Smooth Support Vector Machine for Classification. Computational Optimization and Applications 20, 5–22 (2001)
Quan, Y., Yang, J.: An Improved Parameter Tuning Method for Support Vector Machines. In: Wang, G., Liu, Q., Yao, Y., Skowron, A. (eds.) RSFDGrC 2003. LNCS (LNAI), vol. 2639, pp. 607–610. Springer, Heidelberg (2003)
Zenios, S.A., Pinar, M.C., Dembo, R.S.: A smooth penalty function algorithm for network-structured problems. European Journal of Operation Research 64, 258–277 (1993)
Meng, Z.Q., Dang, C.Y., Zhou, G., Zhu, Y., Jiang, M.: A New Neural Network for Nonlinear Constrained Optimization Problems. In: Yin, F.-L., Wang, J., Guo, C. (eds.) ISNN 2004. LNCS, vol. 3173, pp. 406–412. Springer, Heidelberg (2004)
Yang, X.Q., Meng, Z.Q., Huang, X.X., Pong, G.T.Y.: Smoothing nonlinear penalty functions for constrained optimization. Numerical Functional Analysis Optimization 24, 351–364 (2003)
Rubinov, A.M., Glover, B.M., Yang, X.Q.: Decreasing functions with applications to penalization, SIAM Journal. Optimization 10, 289–313 (1999)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Meng, Z., Zhou, G., Zhu, Y., Peng, L. (2005). A Smoothing Support Vector Machine Based on Exact Penalty Function. In: Hao, Y., et al. Computational Intelligence and Security. CIS 2005. Lecture Notes in Computer Science(), vol 3801. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11596448_83
Download citation
DOI: https://doi.org/10.1007/11596448_83
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-30818-8
Online ISBN: 978-3-540-31599-5
eBook Packages: Computer ScienceComputer Science (R0)