A smoothing support vector machine based on exact penalty function

Authors:
Zhiqing Meng;Gengui Zhou;Yihua Zhu;Lifang Peng
Affiliations:
College of Business and Administration, Zhejiang University of Technology, Zhejiang, China;College of Business and Administration, Zhejiang University of Technology, Zhejiang, China;College of Business and Administration, Zhejiang University of Technology, Zhejiang, China;College of Information Engineering, Xiangtan University, Hunan, China
Venue:
CIS'05 Proceedings of the 2005 international conference on Computational Intelligence and Security - Volume Part I
Year:
2005

Citing 4
Cited 0

SSVM: A Smooth Support Vector Machine for Classification

Computational Optimization and Applications
Decreasing Functions with Applications to Penalization

SIAM Journal on Optimization
A Tutorial on Support Vector Machines for Pattern Recognition

Data Mining and Knowledge Discovery
An improved parameter tuning method for support vector machines

RSFDGrC'03 Proceedings of the 9th international conference on Rough sets, fuzzy sets, data mining, and granular computing

Quantified Score

Hi-index	0.00

Visualization

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.