IDEAS home Printed from https://ideas.repec.org/a/spr/compst/v40y2025i1d10.1007_s00180-024-01471-8.html

Imbalanced data sampling design based on grid boundary domain for big data

Author

Listed:
  • Hanji He

    (South China University of Technology)

  • Jianfeng He

    (South China University of Technology)

  • Liwei Zhang

    (Ping An Insurance Company of China)

Abstract

The data distribution is often associated with a priori-known probability, and the occurrence probability of interest events is small, so a large amount of imbalanced data appears in sociology, economics, engineering, and various other fields. The existing over- and under-sampling methods are widely used in imbalanced data classification problems, but over-sampling leads to overfitting, and under-sampling ignores the effective information. We propose a new sampling design algorithm called the neighbor grid of boundary mixed-sampling (NGBM), which focuses on the boundary information. This paper obtains the classification boundary information through grid boundary domain identification, thereby determining the importance of the samples. Based on this premise, the synthetic minority oversampling technique is applied to the boundary grid, and random under-sampling is applied to the other grids. With the help of this mixed sampling strategy, more important classification boundary information, especially for positive sample information identification is extracted. Numerical simulations and real data analysis are used to discuss the parameter-setting strategy of the NGBM and illustrate the advantages of the proposed NGBM in the imbalanced data, as well as practical applications.

Suggested Citation

  • Hanji He & Jianfeng He & Liwei Zhang, 2025. "Imbalanced data sampling design based on grid boundary domain for big data," Computational Statistics, Springer, vol. 40(1), pages 27-64, January.
    • Handle: RePEc:spr:compst:v:40:y:2025:i:1:d:10.1007_s00180-024-01471-8
    DOI: 10.1007/s00180-024-01471-8
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s00180-024-01471-8
    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/s00180-024-01471-8?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

    for a different version of it.

    References listed on IDEAS

    as
    1. Haiying Wang & Yanyuan Ma, 2021. "Optimal subsampling for quantile regression in big data," Biometrika, Biometrika Trust, vol. 108(1), pages 99-112.
    2. HaiYing Wang & Min Yang & John Stufken, 2019. "Information-Based Optimal Subdata Selection for Big Data Linear Regression," Journal of the American Statistical Association, Taylor & Francis Journals, vol. 114(525), pages 393-405, January.
    3. HaiYing Wang & Rong Zhu & Ping Ma, 2018. "Optimal Subsampling for Large Sample Logistic Regression," Journal of the American Statistical Association, Taylor & Francis Journals, vol. 113(522), pages 829-844, April.
    4. Lulu Zuo & Haixiang Zhang & HaiYing Wang & Liuquan Sun, 2021. "Optimal subsample selection for massive logistic regression with distributed data," Computational Statistics, Springer, vol. 36(4), pages 2535-2562, December.
    5. Jun Yu & HaiYing Wang, 2022. "Subdata selection algorithm for linear model discrimination," Statistical Papers, Springer, vol. 63(6), pages 1883-1906, December.
    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. Xiaohui Yuan & Shiting Zhou & Yue Wang, 2025. "Optimal subsampling algorithm for composite quantile regression with distributed data," Computational Statistics, Springer, vol. 40(9), pages 4901-4936, December.
    2. Min Ren & Shengli Zhao & Mingqiu Wang & Xinbei Zhu, 2024. "Robust optimal subsampling based on weighted asymmetric least squares," Statistical Papers, Springer, vol. 65(4), pages 2221-2251, June.
    3. Yue Chao & Lei Huang & Xuejun Ma & Jiajun Sun, 2024. "Optimal subsampling for modal regression in massive data," Metrika: International Journal for Theoretical and Applied Statistics, Springer, vol. 87(4), pages 379-409, May.
    4. Jun Yu & Jiaqi Liu & HaiYing Wang, 2023. "Information-based optimal subdata selection for non-linear models," Statistical Papers, Springer, vol. 64(4), pages 1069-1093, August.
    5. Tianzhen Wang & Haixiang Zhang, 2022. "Optimal subsampling for multiplicative regression with massive data," Statistica Neerlandica, Netherlands Society for Statistics and Operations Research, vol. 76(4), pages 418-449, November.
    6. Haixiang Zhang & HaiYing Wang, 2026. "Refitted cross-validation estimation for high-dimensional subsamples from low-dimension full data," Computational Statistics, Springer, vol. 41(2), pages 1-15, February.
    7. Di Chang & Guangbao Guo & Lixing Zhu, 2026. "Cor: an R package for optimal subset selection in distributed estimation," Statistical Papers, Springer, vol. 67(3), pages 1-17, June.
    8. Shanshan Wang & Wei Cao & Xiaoxue Hu & Hanyu Zhong & Weixi Sun, 2025. "A Selective Overview of Quantile Regression for Large-Scale Data," Mathematics, MDPI, vol. 13(5), pages 1-30, March.
    9. Ziyang Wang & HaiYing Wang & Nalini Ravishanker, 2023. "Subsampling in Longitudinal Models," Methodology and Computing in Applied Probability, Springer, vol. 25(1), pages 1-29, March.
    10. Amalan Mahendran & Helen Thompson & James M. McGree, 2023. "A model robust subsampling approach for Generalised Linear Models in big data settings," Statistical Papers, Springer, vol. 64(4), pages 1137-1157, August.
    11. Deng, Jiayi & Huang, Danyang & Ding, Yi & Zhu, Yingqiu & Jing, Bingyi & Zhang, Bo, 2024. "Subsampling spectral clustering for stochastic block models in large-scale networks," Computational Statistics & Data Analysis, Elsevier, vol. 189(C).
    12. Baolin Chen & Shanshan Song & Yong Zhou, 2024. "Estimation and testing of expectile regression with efficient subsampling for massive data," Statistical Papers, Springer, vol. 65(9), pages 5593-5613, December.
    13. Cheng Li & Ruihan Luo & Jian-Feng Yang, 2025. "Optimal distributed Poisson subsampling for modal regression with massive data," Statistical Papers, Springer, vol. 66(5), pages 1-32, August.
    14. Jun Jin & Qinghan Liang, 2026. "Communication-efficient distributed composite quantile regression via convolution smoothing and poisson subsampling," Statistical Papers, Springer, vol. 67(1), pages 1-55, February.
    15. Xiaohui Yuan & Yong Li & Xiaogang Dong & Tianqing Liu, 2022. "Optimal subsampling for composite quantile regression in big data," Statistical Papers, Springer, vol. 63(5), pages 1649-1676, October.
    16. Zhaolei Liu, 2025. "Optimal Subsampling for Upper Expectation Parametric Regression," Mathematics, MDPI, vol. 13(7), pages 1-24, March.
    17. Huy N. Chau & J. Lars Kirkby & Dang H. Nguyen & Duy Nguyen & Nhu N. Nguyen & Thai Nguyen, 2024. "On the Inversion‐Free Newton's Method and Its Applications," International Statistical Review, International Statistical Institute, vol. 92(2), pages 284-321, August.
    18. Feifei Wang & Danyang Huang & Tianchen Gao & Shuyuan Wu & Hansheng Wang, 2022. "Sequential one‐step estimator by sub‐sampling for customer churn analysis with massive data sets," Journal of the Royal Statistical Society Series C, Royal Statistical Society, vol. 71(5), pages 1753-1786, November.
    19. Florian Combes & Ricardo Fraiman & Badih Ghattas, 2024. "Subsampling under distributional constraints," Post-Print hal-04742977, HAL.
    20. Su, Miaomiao & Wang, Ruoyu & Wang, Qihua, 2022. "A two-stage optimal subsampling estimation for missing data problems with large-scale data," Computational Statistics & Data Analysis, Elsevier, vol. 173(C).

    More about this item

    Keywords

    ;
    ;
    ;
    ;

    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:spr:compst:v:40:y:2025:i:1:d:10.1007_s00180-024-01471-8. 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: 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.