Key points are not available for this paper at this time.
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.
Building similarity graph...
Analyzing shared references across papers
Loading...
Kashvi Taunk
KIIT University
Sanjukta De
Peerless Hospital & B.K.Roy Research Centre
Srishti Verma
Banasthali University
KIIT University
Building similarity graph...
Analyzing shared references across papers
Loading...
Taunk et al. (Wed,) studied this question.
synapsesocial.com/papers/69de6cf87ed287395e558cce — DOI: https://doi.org/10.1109/iccs45141.2019.9065747