CS 451 Quiz 16
K nearest neighbors, kernels
Email address *
K nearest neighbors is an algorithm for *
1 point
Non-linearly-separable data can be handled with a linear classifier by first mapping them to a higher-dimensional feature space *
1 point
The "Kernel trick" refers to *
1 point
This content is neither created nor endorsed by Google. Report Abuse - Terms of Service