Pattern classification by goal programming and support vector machines |
| |
Authors: | Takeshi Asada Yeboon Yun Hirotaka Nakayama Tetsuzo Tanino |
| |
Institution: | (1) Osaka University, Osaka;(2) Kagawa University, Kagawa;(3) Konan University, Konan;(4) Osaka University, Osaka |
| |
Abstract: | Support Vector Machines (SVMs) are now very popular as a powerful method in pattern classification problems. One of main features of SVMs is to produce a separating hyperplane which maximizes the margin in feature space induced by nonlinear mapping using kernel function. As a result, SVMs can treat not only linear separation but also nonlinear separation. While the soft margin method of SVMs considers only the distance between separating hyperplane and misclassified data, we propose in this paper multi-objective programming formulation considering surplus variables. A similar formulation was extensively researched in linear discriminant analysis mostly in 1980s by using Goal Programming(GP). This paper compares these conventional methods such as SVMs and GP with our proposed formulation through several examples.Received: September 2003, Revised: December 2003, |
| |
Keywords: | Support vector machines Multi-objective programming Goal programming |
本文献已被 SpringerLink 等数据库收录! |