A Hybrid Machine Learning Technique for Fusing Fast k-NN and Training Set Reduction: Combining Both Improves the Effectiveness of Classification

摘要

The primary dilemmas in nonparametric algorithms like k-nearest neighbor classification are the largest computational and storage requirements. Moreover, the effectiveness of classification decreases due to uneven distribution of training data. In this paper, we present three approaches to minimize computation time and storage requirements. In order to achieve the goal, we present three approaches: fast k-NN, training set reduction techniques, and a hybrid of the previous two approaches. We have compared three approaches to existing methods and results show that the effectiveness (in terms of execution time and storage requirement) of the three algorithms are significantly better than existing algorithms.