Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 227,738,011 papers from all fields of science
Search
Sign In
Create Free Account
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
6 relations
Algorithm
Graph theory
Held–Karp algorithm
List of algorithms
Expand
Broader (1)
Travelling salesman problem
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
Gait recognition based on gait energy image and linear discriminant analysis
Hongye Xue
,
Zhuoya Hao
International Conference on Signal Processing…
2015
Corpus ID: 14397021
Aiming at the low rate of human gait recognition and other issues, a novel gait recognition based on gait energy image and linear…
Expand
2013
2013
VILO: a rapid learning nearest-neighbor classifier for malware triage
Arun Lakhotia
,
Andrew Walenstein
,
Craig Miles
,
Anshuman Singh
Journal of Computer Virology and Hacking…
2013
Corpus ID: 10567023
VILO is a lazy learner system designed for malware classification and triage. It implements a nearest neighbor (NN) algorithm…
Expand
2013
2013
Simple object recognition based on spatial relations and visual features represented using irregular pyramids
A. Morales-González
,
Edel B. García Reyes
Multimedia tools and applications
2013
Corpus ID: 15118571
Spatial relations among objects and object parts play a fundamental role in the human perception and understanding of images…
Expand
2007
2007
Dimensionality reduction for speech recognition using neighborhood components analysis
Natasha Singh-Miller
,
M. Collins
,
Timothy J. Hazen
Interspeech
2007
Corpus ID: 1970486
Previous work has considered methods for learning projections of high-dimensional acoustic representations to lower dimensional…
Expand
Highly Cited
2007
Highly Cited
2007
Instace-Based AMN Classification for Improved Object Recognition in 2D and 3D Laser Range Data
Rudolph Triebel
,
Richard Schmidt
,
Óscar Martínez Mozos
,
Wolfram Burgard
International Joint Conference on Artificial…
2007
Corpus ID: 1973951
In this paper, we present an algorithm to identify different types of objects from 2D and 3D laser range data. Our method is a…
Expand
2004
2004
Spam Classification Using Nearest Neighbour Techniques
D. Trudgian
Ideal
2004
Corpus ID: 14699056
Spam mail classification and filtering is a commonly investigated problem, yet there has been little research into the…
Expand
2004
2004
2D silhouette and 3D skeletal models for human detection and tracking
C. Orrite-Uruñuela
,
J. M. D. Rincón
,
J. Jaraba
,
Grégory Rogez
Proceedings of the 17th International Conference…
2004
Corpus ID: 12095698
In This work we propose a statistical model for detection and tracking of human silhouette and the corresponding 3D skeletal…
Expand
2004
2004
Nearest-Neighbours for Time Series
J. M. Illa
,
J. Béjar
,
M. Sànchez-Marrè
Applied intelligence (Boston)
2004
Corpus ID: 1775033
This paper presents an application of lazy learning algorithms in the domain of industrial processes. These processes are…
Expand
Highly Cited
2004
Highly Cited
2004
IDS False Alarm Filtering Using KNN Classifier
K. H. Law
,
Lam-for Kwok
Web Information System and Application Conference
2004
Corpus ID: 36721629
Intrusion detection is one of he important aspects in computer security. Many commercial intrusion detection systems (IDSs) are…
Expand
1999
1999
NEAREST NEIGHBOUR STRATEGIES FOR IMAGE UNDERSTANDING
Sameer Singh
,
J. Haddon
,
Markos Markou
1999
Corpus ID: 17685469
Nearest Neighbour algorithms for pattern recognition have been widely studied. It is now well-established that they offer a quick…
Expand
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)
ACCEPT & CONTINUE