Everything About ___
Live briefing

Everything about Kernel method

Class of algorithms for pattern analysis

In machine learning, kernel machines are a class of algorithms for pattern analysis, whose best known member is the support-vector machine (SVM). These methods involve using linear classifiers to solve nonlinear problems. The general task of pattern analysis is to find and study general types of relations in datasets. For many algorithms that solve these tasks, the data in raw representation have to be explicitly transformed into feature vector representations via a user-specified feature map: in contrast, kernel methods require only a user-specified kernel, i.e., a similarity function over all pairs of data points computed using inner products. The feature map in kernel machines is infinite dimensional but only requires a finite dimensional matrix from user-input according to the representer theorem. Kernel machines are slow to compute for datasets larger than a couple of thousand examples without parallel processing. Wikipedia →

🧭 Start here: a 6-step reading path

  1. Read the overview: Kernel methodA 5-minute orientation
  2. Skim a recent paper: ECG-based emotion recognition using random convolutional kernel methodInfluential work since 2022
  3. Pick up a classic book: Kernel methods in computational biologyThe most-reprinted book on the subject
  4. Read the landmark paper: The kernel polynomial methodCited 952 times
  5. Go sideways: Least-squares support vector machineA closely related topic
  6. Go sideways: Support vector machineA closely related topic

📖 Definitions

No dictionary entry for this exact phrase.

🏆 Landmark papers (most cited)

🆕 Influential since 2022

📚 Books worth reading

Ranked by number of editions on Open Library, a rough measure of how lasting a book is.

🔗 Related topics