The model of optimization problem for Support Vector Machine(SVM) is provided, which based on the definitions of the dual norm and the distance between a point and its projection onto a given plane. The model of impro...The model of optimization problem for Support Vector Machine(SVM) is provided, which based on the definitions of the dual norm and the distance between a point and its projection onto a given plane. The model of improved Support Vector Machine based on 1-norm(1-SVM) is provided from the optimization problem, yet it is a discrete programming. With the smoothing technique and optimality knowledge, the discrete programming is changed into a continuous programming. Experimental results show that the algorithm is easy to implement and this method can select and suppress the problem features more efficiently. Illustrative examples show that the 1-SVM deal with the linear or nonlinear classification well.展开更多
基金Supported Partially by National Science Foundation of China (No.10571109,60573018)Science & Technology Research Project of Shanxi Higher-Education (No.20051277)
文摘The model of optimization problem for Support Vector Machine(SVM) is provided, which based on the definitions of the dual norm and the distance between a point and its projection onto a given plane. The model of improved Support Vector Machine based on 1-norm(1-SVM) is provided from the optimization problem, yet it is a discrete programming. With the smoothing technique and optimality knowledge, the discrete programming is changed into a continuous programming. Experimental results show that the algorithm is easy to implement and this method can select and suppress the problem features more efficiently. Illustrative examples show that the 1-SVM deal with the linear or nonlinear classification well.
