Improvements to Train Support Vector Machines Based on Convex Set Conception

Support Vector Machines have been widely used in pattern recognition, regression estimation, and operator inversion. Optimization algorithm is the bottleneck of Support Vector Machines, determining its performance, affecting its practical applications in various fields widely. Ordinary algorithm cannot predict which vectors the Support Vector Machines will be sensitive to. This paper introduces a method that selects possible vectors from sample vectors. It is based on the conception of convex set. On linear separable case this method can exactly find promising vectors and reserve them in the training set. On linear inseparable cases this method finds the vectors that will have effect on the final hyper plane. On both cases it can simplify the training process by greatly reducing the number of training vectors just as shown in the examples.