IDEAS home Printed from https://ideas.repec.org/a/eee/csdana/v203y2025ics0167947324001622.html
   My bibliography  Save this article

Weighted support vector machine for extremely imbalanced data

Author

Listed:
  • Mun, Jongmin
  • Bang, Sungwan
  • Kim, Jaeoh

Abstract

Based on an asymptotically optimal weighted support vector machine (SVM) that introduces label shift, a systematic procedure is derived for applying oversampling and weighted SVM to extremely imbalanced datasets with a cluster-structured positive class. This method formalizes three intuitions: (i) oversampling should reflect the structure of the positive class; (ii) weights should account for both the imbalance and oversampling ratios; (iii) synthetic samples should carry less weight than the original samples. The proposed method generates synthetic samples from the estimated positive class distribution using a Gaussian mixture model. To prevent overfitting to excessive synthetic samples, different misclassification penalties are assigned to the original positive class, synthetic positive class, and negative class. The proposed method is numerically validated through simulations and an analysis of Republic of Korea Army artillery training data.

Suggested Citation

  • Mun, Jongmin & Bang, Sungwan & Kim, Jaeoh, 2025. "Weighted support vector machine for extremely imbalanced data," Computational Statistics & Data Analysis, Elsevier, vol. 203(C).
  • Handle: RePEc:eee:csdana:v:203:y:2025:i:c:s0167947324001622
    DOI: 10.1016/j.csda.2024.108078
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0167947324001622
    Download Restriction: Full text for ScienceDirect subscribers only.

    File URL: https://libkey.io/10.1016/j.csda.2024.108078?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.

    References listed on IDEAS

    as
    1. Robert Tibshirani & Guenther Walther & Trevor Hastie, 2001. "Estimating the number of clusters in a data set via the gap statistic," Journal of the Royal Statistical Society Series B, Royal Statistical Society, vol. 63(2), pages 411-423.
    2. Kuhn, Max, 2008. "Building Predictive Models in R Using the caret Package," Journal of Statistical Software, Foundation for Open Access Statistics, vol. 28(i05).
    3. Ji Hyun Nam & Jongmin Mun & Seongil Jo & Jaeoh Kim, 2024. "Prediction of Forest Fire Risk for Artillery Military Training using Weighted Support Vector Machine for Imbalanced Data," Journal of Classification, Springer;The Classification Society, vol. 41(1), pages 170-189, March.
    4. Sugar, Catherine A. & James, Gareth M., 2003. "Finding the Number of Clusters in a Dataset: An Information-Theoretic Approach," Journal of the American Statistical Association, American Statistical Association, vol. 98, pages 750-763, January.
    5. Young-Geun Park & Yong Won Kwon & Chin Su Koh & Enji Kim & Dong Ha Lee & Sumin Kim & Jongmin Mun & Yeon-Mi Hong & Sanghoon Lee & Ju-Young Kim & Jae-Hyun Lee & Hyun Ho Jung & Jinwoo Cheon & Jin Woo Cha, 2024. "In-vivo integration of soft neural probes through high-resolution printing of liquid electronics on the cranium," Nature Communications, Nature, vol. 15(1), pages 1-15, December.
    6. Lin, Yi, 2004. "A note on margin-based loss functions in classification," Statistics & Probability Letters, Elsevier, vol. 68(1), pages 73-82, June.
    7. Bartlett, Peter L. & Jordan, Michael I. & McAuliffe, Jon D., 2006. "Convexity, Classification, and Risk Bounds," Journal of the American Statistical Association, American Statistical Association, vol. 101, pages 138-156, March.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Li, Pai-Ling & Chiou, Jeng-Min, 2011. "Identifying cluster number for subspace projected functional data clustering," Computational Statistics & Data Analysis, Elsevier, vol. 55(6), pages 2090-2103, June.
    2. Yujia Li & Xiangrui Zeng & Chien‐Wei Lin & George C. Tseng, 2022. "Simultaneous estimation of cluster number and feature sparsity in high‐dimensional cluster analysis," Biometrics, The International Biometric Society, vol. 78(2), pages 574-585, June.
    3. J. Fernando Vera & Rodrigo Macías, 2021. "On the Behaviour of K-Means Clustering of a Dissimilarity Matrix by Means of Full Multidimensional Scaling," Psychometrika, Springer;The Psychometric Society, vol. 86(2), pages 489-513, June.
    4. Fang, Yixin & Wang, Junhui, 2011. "Penalized cluster analysis with applications to family data," Computational Statistics & Data Analysis, Elsevier, vol. 55(6), pages 2128-2136, June.
    5. Athanasios Constantopoulos & John Yfantopoulos & Panos Xenos & Athanassios Vozikis, 2019. "Cluster shifts based on healthcare factors: The case of Greece in an OECD background 2009-2014," Advances in Management and Applied Economics, SCIENPRESS Ltd, vol. 9(6), pages 1-4.
    6. Yi Peng & Yong Zhang & Gang Kou & Yong Shi, 2012. "A Multicriteria Decision Making Approach for Estimating the Number of Clusters in a Data Set," PLOS ONE, Public Library of Science, vol. 7(7), pages 1-9, July.
    7. Z. Volkovich & Z. Barzily & G.-W. Weber & D. Toledano-Kitai & R. Avros, 2012. "An application of the minimal spanning tree approach to the cluster stability problem," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 20(1), pages 119-139, March.
    8. Koltcov, Sergei, 2018. "Application of Rényi and Tsallis entropies to topic modeling optimization," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 512(C), pages 1192-1204.
    9. Šárka Brodinová & Peter Filzmoser & Thomas Ortner & Christian Breiteneder & Maia Rohm, 2019. "Robust and sparse k-means clustering for high-dimensional data," Advances in Data Analysis and Classification, Springer;German Classification Society - Gesellschaft für Klassifikation (GfKl);Japanese Classification Society (JCS);Classification and Data Analysis Group of the Italian Statistical Society (CLADAG);International Federation of Classification Societies (IFCS), vol. 13(4), pages 905-932, December.
    10. Jayan Wijesingha & Thomas Astor & Sunil Nautiyal & Michael Wachendorf, 2025. "Spatial Patterns and Characteristics of Urban–Rural Agricultural Landscapes: A Case Study of Bengaluru, India," Land, MDPI, vol. 14(2), pages 1-21, January.
    11. Gopal, Vikneswaran & Fuentes, Claudio & Casella, George, 2012. "bayesclust: An R Package for Testing and Searching for Significant Clusters," Journal of Statistical Software, Foundation for Open Access Statistics, vol. 47(i14).
    12. Lingsong Meng & Dorina Avram & George Tseng & Zhiguang Huo, 2022. "Outcome‐guided sparse K‐means for disease subtype discovery via integrating phenotypic data with high‐dimensional transcriptomic data," Journal of the Royal Statistical Society Series C, Royal Statistical Society, vol. 71(2), pages 352-375, March.
    13. Paul, Biplab & De, Shyamal K. & Ghosh, Anil K., 2022. "Some clustering-based exact distribution-free k-sample tests applicable to high dimension, low sample size data," Journal of Multivariate Analysis, Elsevier, vol. 190(C).
    14. Fujita, André & Takahashi, Daniel Y. & Patriota, Alexandre G., 2014. "A non-parametric method to estimate the number of clusters," Computational Statistics & Data Analysis, Elsevier, vol. 73(C), pages 27-39.
    15. Yang, Yi & Guo, Yuxuan & Chang, Xiangyu, 2021. "Angle-based cost-sensitive multicategory classification," Computational Statistics & Data Analysis, Elsevier, vol. 156(C).
    16. Adam N. Elmachtoub & Paul Grigas, 2022. "Smart “Predict, then Optimize”," Management Science, INFORMS, vol. 68(1), pages 9-26, January.
    17. Oliver Schaer & Nikolaos Kourentzes & Robert Fildes, 2022. "Predictive competitive intelligence with prerelease online search traffic," Production and Operations Management, Production and Operations Management Society, vol. 31(10), pages 3823-3839, October.
    18. Nam Ho-Nguyen & Fatma Kılınç-Karzan, 2022. "Risk Guarantees for End-to-End Prediction and Optimization Processes," Management Science, INFORMS, vol. 68(12), pages 8680-8698, December.
    19. Anne C. Richer-de-Forges & Dominique Arrouays & Songchao Chen & Zamir Libohova & Dylan E. Beaudette & Hocine Bourennane, 2024. "Mapping Topsoil Behavior to Compaction at National Scale from an Analysis of Field Observations," Land, MDPI, vol. 13(7), pages 1-23, July.
    20. Jonas M. B. Haslbeck & Dirk U. Wulff, 2020. "Estimating the number of clusters via a corrected clustering instability," Computational Statistics, Springer, vol. 35(4), pages 1879-1894, December.

    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:eee:csdana:v:203:y:2025:i:c:s0167947324001622. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/csda .

    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.