Premium
Nearest‐neighbor methods
Author(s) -
Sutton Clifton
Publication year - 2012
Publication title -
wiley interdisciplinary reviews: computational statistics
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.693
H-Index - 38
eISSN - 1939-0068
pISSN - 1939-5108
DOI - 10.1002/wics.1195
Subject(s) - k nearest neighbors algorithm , pattern recognition (psychology) , computer science , cluster analysis , class (philosophy) , artificial intelligence , exploratory data analysis , best bin first , data mining , nearest neighbor graph , point (geometry) , mathematics , geometry
Nearest‐neighbor classification is a simple and popular method for supervised classification. The basic method is to classify a query point as being of a certain class if of the k‐nearest neighbors of the query point, more of them belong to this class than to any other class. Variations of the basic method include weighted nearest‐neighbor methods and adaptive nearest‐neighbor methods (which allow some variables to have greater influence than other variables). WIREs Comput Stat 2012, 4:307–309. doi: 10.1002/wics.1195 This article is categorized under: Statistical Learning and Exploratory Methods of the Data Sciences > Clustering and Classification Statistical Learning and Exploratory Methods of the Data Sciences > Pattern Recognition