Nearest neighbour algorithm

Known as: Nearest neighbor algorithm 
The nearest neighbour algorithm was one of the first algorithms used to determine a solution to the travelling salesman problem. In it, the salesman… (More)
Wikipedia

Related topics

Related topics

6 relations
AlgorithmGraph theoryHeld–Karp algorithmList of algorithms
(More)

Broader (1)

Travelling salesman problem

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
Arabic text classification using k-nearest neighbour algorithm
Many algorithms have been implemented to the problem of Automatic Text Categorization (ATC). Most of the work in this area has… (More)
  • figure 1
  • table 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
2014
2014
Optimization of image interpolation based on nearest neighbour algorithm
This paper proposes an optimization scheme for the image interpolation algorithms, in particular the bilinear algorithm. The only… (More)
  • figure 2
  • figure 1
  • figure 3
  • figure 5
  • figure 4
Is this relevant?
Review
2013
Review
2013
A Review of Data Classification Using K-Nearest Neighbour Algorithm
To classify data whether it is in the field of neural networks or maybe it is any application of Biometrics viz: Handwriting… (More)
  • table I
Is this relevant?
2013
2013
Generalized K-Nearest Neighbour Algorithm-A Predicting Tool
k-nearest neighbour algorithm is a non-parametric machine learning algorithm generally used for classification. It is also known… (More)
Is this relevant?
2008
2008
k-RNN: k-relational nearest neighbour algorithm
The amount of data collected and stored in databases is growing considerably in almost all areas of human activity. In complex… (More)
  • table 1
  • table 3
  • table 4
  • table 5
  • table 6
Is this relevant?
2002
2002
Extending LAESA Fast Nearest Neighbour Algorithm to Find the k Nearest Neighbours
Many pattern recognition tasks make use of the k nearest neighbour (k–NN) technique. In this paper we are interested on fast k… (More)
  • figure 2
  • table 1
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2002
Highly Cited
2002
A Study of K-Nearest Neighbour as an Imputation Method
Data quality is a major concern in Machine Learning and other correlated areas such as Knowledge Discovery from Databases (KDD… (More)
  • table 1
  • figure 1
  • figure 2
  • figure 3
  • table 2
Is this relevant?
Highly Cited
1997
Highly Cited
1997
Shape Indexing Using Approximate Nearest-Neighbour Search in High-Dimensional Spaces
Shape indexing is a way of making rapid associations between features detected in an image and object models that could have… (More)
  • figure 2
  • figure 1
  • figure 4
  • figure 3
  • figure 5
Is this relevant?
Highly Cited
1996
Highly Cited
1996
Experiments with a New Boosting Algorithm
In an earlier paper [9], we introduced a new “boosting” algorithm called AdaBoost which, theoretically, can be used to… (More)
  • figure 3
  • table 1
  • figure 4
  • figure 5
  • table 2
Is this relevant?
1992
1992
Noise smoothing by a fast K-nearest neighbour algorithm
Noise smoothing is a basic operation in image processing. Numerous filters, each to be used for different noise conditions and… (More)
  • table 1
  • table 2
  • table 3
  • table 4
  • figure 1
Is this relevant?