Solving the Problem of the K Parameter in the KNN Classifier Using an Ensemble Learning Approach

Abstract

This paper presents a new solution for choosing the K parameter in the k-nearest neighbor (KNN) algorithm, the solution depending on the idea of ensemble learning, in which a weak KNN classifier is used each time with a different K, starting from one to the square root of the size of the training set. The results of the weak classifiers are combined using the weighted sum rule. The proposed solution was tested and compared to other solutions using a group of experiments in real life problems. The experimental results show that the proposed classifier outperforms the traditional KNN classifier that uses a different number of neighbors, is competitive with other classifiers, and is a promising classifier with strong potential for a wide range of applications.

References in corpus (2)

• Survey of Nearest Neighbor Techniques
• Visual Speech Recognition

Cited by in corpus (8)

• Distance and Similarity Measures Effect on the Performance of K-Nearest Neighbor Classifier -- A Review
• Structural clustering of volatility regimes for dynamic trading strategies
• On Enhancing The Performance Of Nearest Neighbour Classifiers Using Hassanat Distance Metric
• Classification of retail products: From probabilistic ranking to neural networks
• Implementation and Evaluation of a Multivariate Abstraction-Based, Interval-Based Dynamic Time-Warping Method as a Similarity Measure for Longitudinal Medical Records
• Flexible K Nearest Neighbors Classifier: Derivation and Application for Ion-mobility Spectrometry-based Indoor Localization
• Near Neighbor: Who is the Fairest of Them All?
• Tensor Factorization with Label Information for Fake News Detection