The Adept K-Nearest Neighbour Algorithm - An optimization to the Conventional K-Nearest Neighbour Algorithm
This research aims to study the efficiency of a well-known classification algorithm, K-Nearest Neighbour, and suggest a new classification method, an optimised version than one of the existing classification method. The purpose of this research is to reduce the time taken by the existing K- Nearest Neighbour Classification method. The classification algorithm’s purpose is to identify the characteristics that indicate the class to which each document belongs. This pattern not only helps in understanding the existing data but also to predict how new instances will behave. Classification algorithms create classification models by examining already classified data (cases) and inductively finding a predictive pattern.
(2) Biju Issac, Nauman Israr. “ Case Studies in Intelligent Computing: Achievements and Trends”
(3) Altman, N. S. (1992). "An introduction to kernel and nearest-neighbor nonparametric regression".
(4) Antti Ajanki AnAj. http://en.wikipedia.org/wiki/K-nearest_neighbors_algorithm
(5) Based on the study from Jiawei Han, Micheline Kamber. “Data Mining Concepts and Techniques”