Maximing the Margin in the Input Space

Computer Science – Artificial Intelligence

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

19 pages, 5 figures, NIPS workshop

Scientific paper

We propose a novel criterion for support vector machine learning: maximizing the margin in the input space, not in the feature (Hilbert) space. This criterion is a discriminative version of the principal curve proposed by Hastie et al. The criterion is appropriate in particular when the input space is already a well-designed feature space with rather small dimensionality. The definition of the margin is generalized in order to represent prior knowledge. The derived algorithm consists of two alternating steps to estimate the dual parameters. Firstly, the parameters are initialized by the original SVM. Then one set of parameters is updated by Newton-like procedure, and the other set is updated by solving a quadratic programming problem. The algorithm converges in a few steps to a local optimum under mild conditions and it preserves the sparsity of support vectors. Although the complexity to calculate temporal variables increases the complexity to solve the quadratic programming problem for each step does not change. It is also shown that the original SVM can be seen as a special case. We further derive a simplified algorithm which enables us to use the existing code for the original SVM.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Maximing the Margin in the Input Space does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Maximing the Margin in the Input Space, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Maximing the Margin in the Input Space will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-407104

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.