Article | REF: TE5255 V1

Kernel methods for statistical learning

Author: Stéphane CANU

Publication date: February 10, 2007

You do not have access to this resource.
Click here to request your free trial access!

Already subscribed? Log in!


Français

5. Parsimonious core methods

There are various ways of introducing parsimony. In particular, it is always possible to directly impose that the solution depends only on a small number of non-zero coefficients. But it is more elegant to formulate criteria to be minimized so that the solution is naturally parsimonious. This is the case of support vector machines (SVMs), which we'll be looking at next.

In the SVM framework, we search in an EHNR of kernel k the minimal norm function best discriminating...

You do not have access to this resource.

Exclusive to subscribers. 97% yet to be discovered!

You do not have access to this resource.
Click here to request your free trial access!

Already subscribed? Log in!


The Ultimate Scientific and Technical Reference

A Comprehensive Knowledge Base, with over 1,200 authors and 100 scientific advisors
+ More than 10,000 articles and 1,000 how-to sheets, over 800 new or updated articles every year
From design to prototyping, right through to industrialization, the reference for securing the development of your industrial projects

This article is included in

Software technologies and System architectures

This offer includes:

Knowledge Base

Updated and enriched with articles validated by our scientific committees

Services

A set of exclusive tools to complement the resources

Practical Path

Operational and didactic, to guarantee the acquisition of transversal skills

Doc & Quiz

Interactive articles with quizzes, for constructive reading

Subscribe now!

Ongoing reading
Parsimonious core methods