An Improved Weighted Base Classification for Optimum Weighted Nearest Neighbor Classifiers
DOI:
https://doi.org/10.4108/eai.13-7-2018.163339Keywords:
Classification, k-Nearest Neighbor (kNN), Logistic Regression, Decision Trees, Cross-Validation, Machine-Learning (ML), SVM, random forest, improved version of k-nearest neighbor (IVkNN), PythonAbstract
Existing classification studies use two non-parametric classifiers- k-nearest neighbours (kNN) and decision trees, and one parametric classifier-logistic regression, generating high accuracies. Previous research work has compared the results of these classifiers with training patterns of different sizes to study alcohol tests. In this paper, the Improved Version of the kNN (IVkNN) algorithm is presented which overcomes the limitation of the conventional kNN algorithm to classify wine quality. The proposed method typically identifies the same number of nearest neighbours for each test example. Results indicate a higher Overall Accuracy (OA) that oscillates between 67% and 76%. Among the three classifiers, the least sensitive to the training sample size was the kNN and produced the unrivalled OA, followed by sequential decision trees and logistic regression. Based on the sample size, the proposed IVkNN model presented 80% accuracy and 0.375 root mean square error (RMSE).
Downloads
Published
How to Cite
Issue
Section
License
Copyright (c) 2022 EAI Endorsed Transactions on Scalable Information Systems
This work is licensed under a Creative Commons Attribution 3.0 Unported License.
This is an open access article distributed under the terms of the CC BY-NC-SA 4.0, which permits copying, redistributing, remixing, transformation, and building upon the material in any medium so long as the original work is properly cited.