IDEAS home Printed from https://ideas.repec.org/a/spr/jclass/v42y2025i1d10.1007_s00357-024-09491-1.html
   My bibliography  Save this article

Clustering-Based Oversampling Algorithm for Multi-class Imbalance Learning

Author

Listed:
  • Haixia Zhao

    (Shanxi University of Finance and Economics)

  • Jian Wu

    (Shanxi University of Finance and Economics)

Abstract

Multi-class imbalanced data learning faces many challenges. Its complex structural characteristics cause severe intra-class imbalance or overgeneralization in most solution strategies. This negatively affects data learning. This paper proposes a clustering-based oversampling algorithm (COM) to handle multi-class imbalance learning. In order to avoid the loss of important information, COM clusters the minority class based on the structural characteristics of the instances, among which rare instances and outliers are carefully portrayed through assigning a sampling weight to each of the clusters. Clusters with high densities are given low weights, and then, oversampling is performed within clusters to avoid overgeneralization. COM avoids intra-class imbalance effectively because low-density clusters are more likely than high-density ones to be selected to synthesize instances. Our study used the UCI and KEEL imbalanced datasets to demonstrate the effectiveness and stability of the proposed method.

Suggested Citation

  • Haixia Zhao & Jian Wu, 2025. "Clustering-Based Oversampling Algorithm for Multi-class Imbalance Learning," Journal of Classification, Springer;The Classification Society, vol. 42(1), pages 205-220, March.
  • Handle: RePEc:spr:jclass:v:42:y:2025:i:1:d:10.1007_s00357-024-09491-1
    DOI: 10.1007/s00357-024-09491-1
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s00357-024-09491-1
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.

    File URL: https://libkey.io/10.1007/s00357-024-09491-1?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
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    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:spr:jclass:v:42:y:2025:i:1:d:10.1007_s00357-024-09491-1. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.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.