Classification of Imbalanced Datasets using One-Class SVM, k-Nearest Neighbors and CART Algorithm

12Citations
Citations of this article
18Readers
Mendeley users who have this article in their library.

Abstract

In this paper a new algorithm, OKC classifier is proposed that is a hybrid of One-Class SVM, k-Nearest Neighbours and CART algorithms. The performance of most of the classification algorithms is significantly influenced by certain characteristics of datasets on which these are modeled such as imbalance in class distribution, class overlapping, lack of density, etc. The proposed algorithm can perform the classification task on imbalanced datasets without re-sampling. This algorithm is compared against a few well known classification algorithms and on datasets having varying degrees of class imbalance and class overlap. The experimental results demonstrate that the proposed algorithm has performed better than a number of standard classification algorithms.

Cite

CITATION STYLE

APA

Ayyagari, M. R. (2020). Classification of Imbalanced Datasets using One-Class SVM, k-Nearest Neighbors and CART Algorithm. International Journal of Advanced Computer Science and Applications, 11(11), 1–5. https://doi.org/10.14569/IJACSA.2020.0111101

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free