Scribd
Upload
26 views

Nearest Neighbor Search

Nearest Neighbor Search is an algorithmic problem to find the data point in a set that is closest to a given query point. It has applications in routing emergency vehicles to the location of a fire most efficiently and in classification problems to predict an unlabeled data point's class based on its nearest labeled neighbor. The document provides an example of using nearest neighbor search to classify whether a person is likely Democrat or Republican based on attributes like age, income, etc by finding the labeled point closest in the multi-dimensional attribute space.

Uploaded by

Jesus Armando Beltran Verdugo
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
26 views

Nearest Neighbor Search

Nearest Neighbor Search is an algorithmic problem to find the data point in a set that is closest to a given query point. It has applications in routing emergency vehicles to the location of a fire most efficiently and in classification problems to predict an unlabeled data point's class based on its nearest labeled neighbor. The document provides an example of using nearest neighbor search to classify whether a person is likely Democrat or Republican based on attributes like age, income, etc by finding the labeled point closest in the multi-dimensional attribute space.

Uploaded by

Jesus Armando Beltran Verdugo
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 1

Nearest Neighbor Search

Input

Output

Input: Description: A set S of n point in d dimensions; a query point q. Problem: Which point in S is closest to q?

Overview
Excerpt from: the need to quickly find the nearest neighbor to a query point arises in a variety of geometric applications. The classic example in two dimensions is designing a system to dispatch emergency vehicles to the scene of a fire. Once the dispatcher learns the location of the fire, she uses a map to find the firehouse closest to this point so as to minimize transportation delays. This situation occurs in any application mapping customers to service providers. Nearest-neighbor search is also important in classification. Suppose we are given a collection of data about people (say age, height, weight, years of education, sex, and income level) each of whom has been labeled as Democrat or Republican. We seek a classifier to decide wich way a different person is likely to vote. Each of the people in our data set is represented by a partylabeled point in n-dimensional feature space. A simple classifier can be built by assigning to new point the party affiliation its nearest neighbor. notice: The nearest neighbor method was initially introduced by J.G. Skellam where the ratio of ex

KNN: k-nereast neighbor

You might also like