Kernel Methods: Pattern recognition, Principal component analysis - Brossura

 
9786137316535: Kernel Methods: Pattern recognition, Principal component analysis

Sinossi

Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. In computer science, kernel methods (KMs) are a class of algorithms for pattern analysis, whose best known element is the support vector machine (SVM). The general task of pattern analysis is to find and study general types of relations (for example clusters, rankings, principal components, correlations, classifications) in general types of data (such as sequences, text documents, sets of points, vectors, images, etc.).KMs approach the problem by mapping the data into a high dimensional feature space, where each coordinate corresponds to one feature of the data items, transforming the data into a set of points in a Euclidean space. In that space, a variety of methods can be used to find relations in the data. Since the mapping can be quite general (not necessarily linear, for example), the relations found in this way are accordingly very general. This approach is called the kernel trick.

Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.

Altre edizioni note dello stesso titolo

9788180520778: Kernel Methods In Computational Biology [Paperback] [Jan 01, 2005] Tsuda

Edizione in evidenza

ISBN 10:  8180520773 ISBN 13:  9788180520778
Brossura