Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 218,238,536 papers from all fields of science
Search
Sign In
Create Free Account
K-nearest neighbors algorithm
Known as:
Ibk algorithm
, Nearest neighbors classifier
, K-NN
Expand
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
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
47 relations
Anomaly detection
ArrayTrack
Belur V. Dasarathy
Bias–variance tradeoff
Expand
Broader (1)
Statistical classification
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2015
Highly Cited
2015
An Empirical Study of Distance Metrics for k-Nearest Neighbor Algorithm
Kittipong Chomboon
,
P. Chujai
,
Pongsakorn Teerarassammee
,
Kittisak Kerdprasop
,
Nittaya Kerdprasop
2015
Corpus ID: 55489423
This research aims at studying the performance of k-nearest neighbor classification when applying different distance measurements…
Expand
Highly Cited
2014
Highly Cited
2014
Diagnosis of Diabetes Mellitus using K Nearest Neighbor Algorithm
Krati Saxena
,
Z. Khan
,
Shefali Singh
2014
Corpus ID: 53559582
Diabetes is one of the major global health problems. According to WHO 2011 report, around 346 million people worldwide are…
Expand
Highly Cited
2014
Highly Cited
2014
Anomaly Detection Using Self-Organizing Maps-Based K-Nearest Neighbor Algorithm
Jing Tian
,
M. Azarian
,
M. Pecht
2014
Corpus ID: 42380100
Self-organizing maps have been used extensively for condition-based maintenance, where quantization errors of test data referring…
Expand
Highly Cited
2012
Highly Cited
2012
Enhanced weighted K-nearest neighbor algorithm for indoor Wi-Fi positioning systems
B. Shin
,
Jung Ho Lee
,
Taikjin Lee
,
H. Kim
International Conference on Computing Technology…
2012
Corpus ID: 16109612
Location-based systems for indoor positioning have been studied widely owing to their application in various fields. The…
Expand
Highly Cited
2010
Highly Cited
2010
An adaptive k-nearest neighbor algorithm
Shiliang Sun
,
Rongqing Huang
Seventh International Conference on Fuzzy Systems…
2010
Corpus ID: 22903106
An adaptive k-nearest neighbor algorithm (AdaNN) is brought forward in this paper to overcome the limitation of the traditional k…
Expand
Highly Cited
2009
Highly Cited
2009
How k-nearest neighbor parameters affect its performance
Gustavo E. A. P. A. Batista
,
Diego Furtado Silva
2009
Corpus ID: 16606615
The k-Nearest Neighbor is one of the simplest Machine Learning algorithms. Besides its simplicity, k-Nearest Neighbor is a widely…
Expand
Highly Cited
2005
Highly Cited
2005
Monitoring k-nearest neighbor queries over moving objects
Xiaohui Yu
,
K. Pu
,
Nick Koudas
IEEE International Conference on Data Engineering
2005
Corpus ID: 1886676
Many location-based applications require constant monitoring of k-nearest neighbor (k-NN) queries over moving objects within a…
Expand
Highly Cited
2004
Highly Cited
2004
An Investigation of Practical Approximate Nearest Neighbor Algorithms
Ting Liu
,
A. Moore
,
Alexander G. Gray
,
Ke Yang
Neural Information Processing Systems
2004
Corpus ID: 12565844
This paper concerns approximate nearest neighbor searching algorithms, which have become increasingly important, especially in…
Expand
Highly Cited
2001
Highly Cited
2001
Text Categorization Using Weight Adjusted k-Nearest Neighbor Classification
Eui-Hong Han
,
G. Karypis
,
Vipin Kumar
Pacific-Asia Conference on Knowledge Discovery…
2001
Corpus ID: 2026944
Text categorization presents unique challenges due to the large number of attributes present in the data set, large number of…
Expand
Highly Cited
2001
Highly Cited
2001
K-Local Hyperplane and Convex Distance Nearest Neighbor Algorithms
Pascal Vincent
,
Yoshua Bengio
Neural Information Processing Systems
2001
Corpus ID: 5874434
Guided by an initial idea of building a complex (non linear) decision surface with maximal local margin in input space, we give a…
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