Facebook pixel tracking

The Science and Information (SAI) Organization publishes open-access peer-reviewed journals in computer science and artificial intelligence.

Contact Info
Website thesai.org
Follow Us
Contact Info
Follow Us
Research Article | Open Access |

Adaptive Generation-based Approaches of Oversampling using Different Sets of Base and Nearest Neighbor’s Instances

Author 1: Hatem S Y Nabus Author 2: Aida Ali Author 3: Shafaatunnur Hassan Author 4: Siti Mariyam Shamsuddin Author 5: Ismail B Mustapha Author 6: Faisal Saeed
International Journal of Advanced Computer Science and Applications (IJACSA) · Vol. 13, No. 4 · Published 2022

DOI: https://doi.org/10.14569/IJACSA.2022.0130461

Abstract

Standard classification algorithms often face a challenge of learning from imbalanced datasets. While several approaches have been employed in addressing this problem, methods that involve oversampling of minority samples remain more widely used in comparison to algorithmic modifications. Most variants of oversampling are derived from Synthetic Minority Oversampling Technique (SMOTE), which involves generation of synthetic minority samples along a point in the feature space between two minority class instances. The main reasons these variants produce different results lies in (1) the samples they use as initial selection / base samples and the nearest neighbors. (2) Variation in how they handle minority noises. Therefore, this paper presented different combinations of base and nearest neighbor’s samples which never used before to monitor their effect in comparison to the standard oversampling techniques. Six methods; three combinations of Only Danger Oversampling (ODO) techniques, and three combinations of Danger Noise Oversampling (DNO) techniques are proposed. The ODO’s and DNO’s methods use different groups of samples as base and nearest neighbors. While the three ODO’s methods do not consider the minority noises, the three DNO’s include the minority noises in both the base and neighbor samples. The performances of the proposed methods are compared to that of several standard oversampling algorithms. We present experimental results demonstrating a significant improvement in the recall metric.

Keywords

How to Cite this Article

Nabus, H. S. Y., Ali, A., Hassan, S., Shamsuddin, S. M., Mustapha, I. B., & Saeed, F. (2022). Adaptive Generation-based Approaches of Oversampling using Different Sets of Base and Nearest Neighbor’s Instances. International Journal of Advanced Computer Science and Applications, 13(4). https://doi.org/10.14569/IJACSA.2022.0130461

Nabus, Hatem S Y, et al.. "Adaptive Generation-based Approaches of Oversampling using Different Sets of Base and Nearest Neighbor’s Instances." International Journal of Advanced Computer Science and Applications, vol. 13, no. 4, 2022, https://doi.org/10.14569/IJACSA.2022.0130461.

@article{Nabus2022,
  title     = {Adaptive Generation-based Approaches of Oversampling using Different Sets of Base and Nearest Neighbor’s Instances},
  journal   = {International Journal of Advanced Computer Science and Applications},
  volume    = {13},
  number    = {4},
  year      = {2022},
  publisher = {The Science and Information Organization},
  author    = {Hatem S Y Nabus and Aida Ali and Shafaatunnur Hassan and Siti Mariyam Shamsuddin and Ismail B Mustapha and Faisal Saeed},
  doi       = {10.14569/IJACSA.2022.0130461},
  url       = {https://doi.org/10.14569/IJACSA.2022.0130461}
}

Open Access — licensed under a Creative Commons Attribution 4.0 International License. Unrestricted use, distribution, and reproduction in any medium, even commercially, as long as the original work is properly cited.