stat441w18/summary 1: Difference between revisions
| Line 13: | Line 13: | ||
By conventional notation, we have that | By conventional notation, we have that | ||
<math> f(x; \alpha) = \sum_{i = 1}^{N} \alpha_i k(x, x_i)</math> | <math> f(x; \alpha) = \sum_{i = 1}^{N} \alpha_i k(x, x_i)</math> where k is a kernel function and <math> \alpha </math> are the corresponding weights. | ||
An example of a kernel method is the support vector machine. These methids | An example of a kernel method is the support vector machine. These methids | ||
Revision as of 09:38, 7 March 2018
Random features for large scale kernel machines
Group members
Faith Lee
Jacov Lisulov
Shiwei Gong
Introduction and problem motivation
In classification problems, kernel methods are used for pattern analysis and require only user-specified kernel. Kernel methods can be thought of as instance-based methods where they learn the i-th training examples are "remembered" to learn for corresponding weights. Prediction on untrained examples are then treated with a similarity function, k (also called a kernel between this untrained example and each of the training inputs. In short, a similarity function measures similarity between two objects. By conventional notation, we have that
[math]\displaystyle{ f(x; \alpha) = \sum_{i = 1}^{N} \alpha_i k(x, x_i) }[/math] where k is a kernel function and [math]\displaystyle{ \alpha }[/math] are the corresponding weights.
An example of a kernel method is the support vector machine. These methids