Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

Related topics

Related topics

47 relations
Anomaly detectionArrayTrackBelur V. DasarathyBias–variance tradeoff

Broader (1)

Statistical classification

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2010
Highly Cited
2010
An adaptive k-nearest neighbor algorithm
An adaptive k-nearest neighbor algorithm (AdaNN) is brought forward in this paper to overcome the limitation of the traditional k… 
Highly Cited
2010
Highly Cited
2010
An Improved k-Nearest Neighbor Classification Using Genetic Algorithm
k-Nearest Neighbor (KNN) is one of the most popular algorithms for pattern recognition. Many researchers have found that the KNN… 
Review
2010
Review
2010
Investigating the Performance of Naive- Bayes Classifiers and K- Nearest Neighbor Classifiers
Probability theory is the framework for making decision under uncertainty. In classification, Bayes' rule is used to calculate… 
Highly Cited
2008
Highly Cited
2008
Fast k nearest neighbor search using GPU
Statistical measures coming from information theory represent interesting bases for image and video processing tasks such as… 
Highly Cited
2005
Highly Cited
2005
A k-nearest neighbor based algorithm for multi-label classification
In multi-label learning, each instance in the training set is associated with a set of labels, and the task is to output a label… 
Highly Cited
2004
Highly Cited
2004
An Investigation of Practical Approximate Nearest Neighbor Algorithms
This paper concerns approximate nearest neighbor searching algorithms, which have become increasingly important, especially in… 
Highly Cited
2001
Highly Cited
2001
Text Categorization Using Weight Adjusted k-Nearest Neighbor Classification
Text categorization presents unique challenges due to the large number of attributes present in the data set, large number of… 
Highly Cited
2001
Highly Cited
2001
K-Local Hyperplane and Convex Distance Nearest Neighbor Algorithms
Guided by an initial idea of building a complex (non linear) decision surface with maximal local margin in input space, we give a… 
Highly Cited
1998
Highly Cited
1998
Optimal multi-step k-nearest neighbor search
For an increasing number of modern database applications, efficient support of similarity search becomes an important task. Along… 
Highly Cited
1982
Highly Cited
1982
On k-Nearest Neighbor Voronoi Diagrams in the Plane
The notion of Voronoi diagram for a set of N points in the Euclidean plane is generalized to the Voronoi diagram of order k and… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)