A Bottom-Up Method for Simplifying Support Vector Solutions
スポンサーリンク
概要
- 論文の詳細を見る
The high generalization ability of support vector machines (SVMs) has been shown in many practical applications, however, they are considerably slower in test phase than other learning approaches due to the possibly big number of support vectors comprised in their solution. In this letter, we describe a method to reduce such number of support vectors. The reduction process iteratively selects two nearest support vectors belonging to the same class and replaces them by a newly constructed one. Through the analysis of relation between vectors in input and feature spaces, we present the construction of the new vectors that requires to find the unique maximum point of a one-variable function on (0,1), not to minimize a function of many variables with local minima in previous reduced set methods. Experimental results on real life dataset show that the proposed method is effective in reducing number of support vectors and preserving machine's generalization performance.
- Institute of Electrical and Electronics Engineers (IEEE)の論文
- 2006-05-00
Institute of Electrical and Electronics Engineers (IEEE) | 論文
- Analysis on Operation of a F-FET Memory With an Intermediate Electrode
- EXIT Chart-Aided Adaptive Coding for Multilevel BICM With Turbo Equalization in Frequency-Selective MIMO Channels
- Iterative Frequency Domain Joint-over-Antenna Detection in Multiuser MIMO
- An Analytical Method for MMSE MIMO Turbo Equalizer EXIT Chart Computation
- Multilevel-Coded QAM With MIMO Turbo-Equalization in Broadband Single-Carrier Signaling