# Current Slide

Small screen detected. You are viewing the mobile version of SlideWiki. If you wish to edit slides you will need to use a larger device.

### The k-Nearest Neighbor Algorithm

- All instances correspond to points in the n-D space
- The nearest neighbor are defined in terms of Euclidean distance, dist(
**X1**,**X2**) - Target function could be discrete- or real- valued
- For discrete-valued,
*k*-NN returns the most common value among the*k*training examples nearest to*xq* - Vonoroi diagram: the decision surface induced by 1-NN for a typical set of training examples

**Speaker notes:**

## Content Tools

Tools

Sources (0)

Tags (0)

Comments (0)

History

Usage

Questions (0)

Playlists (0)

Quality

### Sources

There are currently no sources for this slide.