Jump to content

K-nearest neighbors algorithm

From Wikipedia, the free encyclopedia

This is an old revision of this page, as edited by 129.215.45.58 (talk) at 15:50, 21 April 2005 (A brief definition of the K-nearest-neighbour algorithm, nothing previously existed.). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

As the name suggests this is very similar to the nearest nighbour classification method, the diffrence lies in the fact that rather than assigning a classification based upon the classification of the nerest neighbour the algorithm selects a set which contains the k nearest neighbours and assigns the class label to the new data point based upon the most numerous class with the set.