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 a set of observations of two classes (x i , y i ) i = 1, n with ...
Exclusive to subscribers. 97% yet to be discovered!
Already subscribed? Log in!
Parsimonious core methods
Practical aspects of using core machines
Article included in this offer
"Software technologies and System architectures"
(
230 articles
)
Updated and enriched with articles validated by our scientific committees
A set of exclusive tools to complement the resources
References
A few books to find out more
Exclusive to subscribers. 97% yet to be discovered!
Already subscribed? Log in!
