Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

K-nearest neighbors algorithm

Known as: Ibk algorithm, Nearest neighbors classifier, K-NN 
In pattern recognition, the k-Nearest Neighbors algorithm (or k-NN for short) is a non-parametric method used for classification and regression. In… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2009
Highly Cited
2009
For many computer vision problems, the most time consuming component consists of nearest neighbor matching in high-dimensional… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2008
Highly Cited
2008
Statistical measures coming from information theory represent interesting bases for image and video processing tasks such as… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • table 1
Is this relevant?
Highly Cited
2006
Highly Cited
2006
We consider visual category recognition in the framework of measuring similarities, or equivalently perceptual distances, to… Expand
  • figure 1
  • table 1
  • table 2
  • figure 2
  • table 3
Is this relevant?
Highly Cited
1998
Highly Cited
1998
For an increasing number of modern database applications, efficient support of similarity search becomes an important task. Along… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1997
Highly Cited
1997
Recently, similarity queries on feature vectors have been widely used to perform content-based retrieval of images. To apply this… Expand
  • figure 1
  • figure 2
  • table 3
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
1995
Highly Cited
1995
A frequently encountered type of query in Geographic Information Systems is to find the k nearest neighbor objects to a given… Expand
  • figure 5
Is this relevant?
Highly Cited
1995
Highly Cited
1995
Nearest neighbor classification expects the class conditional probabilities to be locally constant, and suffers from bias in high… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1994
Highly Cited
1994
Consider a set of <italic>S</italic> of <italic>n</italic> data points in real <italic>d</italic>-dimensional space, R<supscrpt… Expand
Is this relevant?
Highly Cited
1985
Highly Cited
1985
Classification of objects is an important area of research and application in a variety of fields. In the presence of full… Expand
  • table I
  • table II
  • table III
  • table IV
  • table V
Is this relevant?
Highly Cited
1975
Highly Cited
1975
Computation of the k-nearest neighbors generally requires a large number of expensive distance computations. The method of branch… Expand
  • figure 2
  • figure 1
  • figure 3
Is this relevant?