IDEAS home Printed from https://ideas.repec.org/a/hin/jnlmpe/3526539.html
   My bibliography  Save this article

An Improved Oversampling Algorithm Based on the Samples’ Selection Strategy for Classifying Imbalanced Data

Author

Listed:
  • Wenhao Xie
  • Gongqian Liang
  • Zhonghui Dong
  • Baoyu Tan
  • Baosheng Zhang

Abstract

The imbalance data refers to at least one of its classes which is usually outnumbered by the other classes. The imbalanced data sets exist widely in the real world, and the classification for them has become one of the hottest issues in the field of data mining. At present, the classification solutions for imbalanced data sets are mainly based on the algorithm-level and the data-level. On the data-level, both oversampling strategies and undersampling strategies are used to realize the data balance via data reconstruction. SMOTE and Random-SMOTE are two classic oversampling algorithms, but they still possess the drawbacks such as blind interpolation and fuzzy class boundaries. In this paper, an improved oversampling algorithm based on the samples’ selection strategy for the imbalanced data classification is proposed. On the basis of the Random-SMOTE algorithm, the support vectors (SV) are extracted and are treated as the parent samples to synthesize the new examples for the minority class in order to realize the balance of the data. Lastly, the imbalanced data sets are classified with the SVM classification algorithm. F-measure value, G-mean value, ROC curve, and AUC value are selected as the performance evaluation indexes. Experimental results show that this improved algorithm demonstrates a good classification performance for the imbalanced data sets.

Suggested Citation

  • Wenhao Xie & Gongqian Liang & Zhonghui Dong & Baoyu Tan & Baosheng Zhang, 2019. "An Improved Oversampling Algorithm Based on the Samples’ Selection Strategy for Classifying Imbalanced Data," Mathematical Problems in Engineering, Hindawi, vol. 2019, pages 1-13, May.
  • Handle: RePEc:hin:jnlmpe:3526539
    DOI: 10.1155/2019/3526539
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/MPE/2019/3526539.pdf
    Download Restriction: no

    File URL: http://downloads.hindawi.com/journals/MPE/2019/3526539.xml
    Download Restriction: no

    File URL: https://libkey.io/10.1155/2019/3526539?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:hin:jnlmpe:3526539. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Mohamed Abdelhakeem (email available below). General contact details of provider: https://www.hindawi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.