reviewMay 1, 2019Closed access
A Brief Review of Nearest Neighbor Algorithm for Learning and Classification
Indexed incrossref
Abstract
K-Nearest Neighbor (kNN) algorithm is an effortless but productive machine learning algorithm. It is effective for classification as well as regression. However, it is more widely used for classification prediction. kNN groups the data into coherent clusters or subsets and classifies the newly inputted data based on its similarity with previously trained data. The input is assigned to the class with which it shares the most nearest neighbors. Though kNN is effective, it has many weaknesses. This paper highlights the kNN method and its modified versions available in previously done researches. These variants remove the weaknesses of kNN and provide a more efficient method.
Citation impact
801
total citations
- FWCI
- 19.16
- Percentile
- 100%
- References
- 6
Citations per year
Authors
4Topics & keywords
Topics
Keywords
- k-nearest neighbors algorithm
- Computer science
- Artificial intelligence
- Pattern recognition (psychology)
- Similarity (geometry)
- Class (philosophy)
- Nearest neighbor search
- Statistical classification
UN Sustainable Development Goals
- Decent work and economic growth
No related works found for this paper.