{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,24]],"date-time":"2026-04-24T09:39:28Z","timestamp":1777023568909,"version":"3.51.4"},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2026,4,24]],"date-time":"2026-04-24T00:00:00Z","timestamp":1776988800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,4,24]],"date-time":"2026-04-24T00:00:00Z","timestamp":1776988800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["62176040"],"award-info":[{"award-number":["62176040"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Int. J. Mach. Learn. & Cyber."],"published-print":{"date-parts":[[2026,6]]},"DOI":"10.1007\/s13042-026-03095-4","type":"journal-article","created":{"date-parts":[[2026,4,24]],"date-time":"2026-04-24T08:44:20Z","timestamp":1777020260000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Mst-b\u00e9zier: an oversampling method for imbalanced data learning based on B\u00e9zier curves guided by minimum spanning trees"],"prefix":"10.1007","volume":"17","author":[{"given":"Xinyu","family":"Chen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chao","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,4,24]]},"reference":[{"key":"3095_CR1","doi-asserted-by":"crossref","unstructured":"Liu R, Hall LO, Bowyer KW, Goldgof DB, Gatenby R, Ahmed KB (2017) Synthetic minority image over-sampling technique: How to improve auc for glioblastoma patient survival prediction. In: 2017 IEEE International Conference on Systems, Man, and Cybernetics (SMC), pp. 1357\u20131362. IEEE","DOI":"10.1109\/SMC.2017.8122802"},{"key":"3095_CR2","unstructured":"Chan PK, Stolfo SJ (1998) Toward scalable learning with non-uniform class and cost distributions: a case study in credit card fraud detection. In: KDD, vol. 98, pp. 164\u2013168"},{"issue":"12","key":"3095_CR3","doi-asserted-by":"publisher","first-page":"2809","DOI":"10.1109\/TKDE.2013.37","volume":"25","author":"H Cao","year":"2013","unstructured":"Cao H, Li X-L, Woon DY-K, Ng S-K (2013) Integrated oversampling for imbalanced time series classification. IEEE Trans Knowl Data Eng 25(12):2809\u20132822","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"12","key":"3095_CR4","doi-asserted-by":"publisher","first-page":"1062","DOI":"10.1093\/bioinformatics\/16.12.1062","volume":"16","author":"W Choe","year":"2000","unstructured":"Choe W, Ersoy OK, Bina M (2000) Neural network schemes for detecting rare events in human genomic dna. Bioinformatics 16(12):1062\u20131072","journal-title":"Bioinformatics"},{"issue":"1","key":"3095_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1007730.1007733","volume":"6","author":"NV Chawla","year":"2004","unstructured":"Chawla NV, Japkowicz N, Kotcz A (2004) Special issue on learning from imbalanced data sets. ACM SIGKDD Explorat Newsl 6(1):1\u20136","journal-title":"ACM SIGKDD Explorat Newsl"},{"issue":"4","key":"3095_CR6","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1109\/TSMCC.2011.2161285","volume":"42","author":"M Galar","year":"2011","unstructured":"Galar M, Fernandez A, Barrenechea E, Bustince H, Herrera F (2011) A review on ensembles for the class imbalance problem: bagging-, boosting-, and hybrid-based approaches. IEEE Trans Syst Man Cybern C Appl Rev 42(4):463\u2013484","journal-title":"IEEE Trans Syst Man Cybern C Appl Rev"},{"key":"3095_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ins.2018.06.056","volume":"465","author":"G Douzas","year":"2018","unstructured":"Douzas G, Bacao F, Last F (2018) Improving imbalanced learning through a heuristic oversampling method based on k-means and smote. Inf Sci 465:1\u201320","journal-title":"Inf Sci"},{"key":"3095_CR8","doi-asserted-by":"crossref","unstructured":"Pradipta GA, Wardoyo R, Musdholifah A, Sanjaya INH, Ismail M (2021) Smote for handling imbalanced data problem: a review. In: 2021 Sixth International Conference on Informatics and Computing (ICIC), pp. 1\u20138. IEEE","DOI":"10.1109\/ICIC54025.2021.9632912"},{"key":"3095_CR9","doi-asserted-by":"publisher","first-page":"863","DOI":"10.1613\/jair.1.11192","volume":"61","author":"A Fern\u00e1ndez","year":"2018","unstructured":"Fern\u00e1ndez A, Garcia S, Herrera F, Chawla NV (2018) Smote for learning from imbalanced data: progress and challenges, marking the 15-year anniversary. J Artif Intell Res 61:863\u2013905","journal-title":"J Artif Intell Res"},{"key":"3095_CR10","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1613\/jair.953","volume":"16","author":"NV Chawla","year":"2002","unstructured":"Chawla NV, Bowyer KW, Hall LO, Kegelmeyer WP (2002) Smote: synthetic minority over-sampling technique. J Artif Intell Res 16:321\u2013357","journal-title":"J Artif Intell Res"},{"key":"3095_CR11","doi-asserted-by":"crossref","unstructured":"Han H, Wang W-Y, Mao B-H (2005) Borderline-smote: a new over-sampling method in imbalanced data sets learning. In: International Conference on Intelligent Computing, pp. 878\u2013887. Springer","DOI":"10.1007\/11538059_91"},{"key":"3095_CR12","doi-asserted-by":"crossref","unstructured":"He H, Bai Y, Garcia EA, Li S (2008) Adasyn: adaptive synthetic sampling approach for imbalanced learning. In: 2008 IEEE International Joint Conference on Neural Networks (IEEE World Congress on Computational Intelligence), pp. 1322\u20131328. IEEE","DOI":"10.1109\/IJCNN.2008.4633969"},{"key":"3095_CR13","doi-asserted-by":"crossref","unstructured":"Bunkhumpornpat C, Sinapiromsaran K, Lursinsap C (2009) Safe-level-smote: safe-level-synthetic minority over-sampling technique for handling the class imbalanced problem. In: Pacific-Asia Conference on Knowledge Discovery and Data Mining, pp. 475\u2013482. Springer","DOI":"10.1007\/978-3-642-01307-2_43"},{"issue":"1","key":"3095_CR14","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1504\/IJKESDP.2011.039875","volume":"3","author":"HM Nguyen","year":"2011","unstructured":"Nguyen HM, Cooper EW, Kamei K (2011) Borderline over-sampling for imbalanced data classification. Int J Knowl Eng Soft Data Paradigms 3(1):4\u201321","journal-title":"Int J Knowl Eng Soft Data Paradigms"},{"key":"3095_CR15","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2024.128492","volume":"609","author":"P Sun","year":"2024","unstructured":"Sun P, Du Y, Xiong S (2024) Nearest neighbors and density-based undersampling for imbalanced data classification with class overlap. Neurocomputing 609:128492","journal-title":"Neurocomputing"},{"key":"3095_CR16","doi-asserted-by":"crossref","unstructured":"Khorshidi HA, Aickelin U (2025) A synthetic over-sampling method with minority and majority classes for imbalance problems. Knowl Inf Syst: 1\u201334","DOI":"10.1007\/s10115-025-02394-6"},{"key":"3095_CR17","doi-asserted-by":"publisher","first-page":"30655","DOI":"10.1109\/ACCESS.2022.3158977","volume":"10","author":"A Sharma","year":"2022","unstructured":"Sharma A, Singh PK, Chandra R (2022) Smotified-gan for class imbalanced pattern classification problems. Ieee Access 10:30655\u201330665","journal-title":"Ieee Access"},{"issue":"22","key":"3095_CR18","doi-asserted-by":"publisher","first-page":"26518","DOI":"10.1007\/s10489-023-04846-4","volume":"53","author":"Y Chen","year":"2023","unstructured":"Chen Y, Pedrycz W, Yang J (2023) A new boundary-degree-based oversampling method for imbalanced data. Appl Intell 53(22):26518\u201326541","journal-title":"Appl Intell"},{"issue":"5500","key":"3095_CR19","doi-asserted-by":"publisher","first-page":"2319","DOI":"10.1126\/science.290.5500.2319","volume":"290","author":"JB Tenenbaum","year":"2000","unstructured":"Tenenbaum JB, Silva VD, Langford JC (2000) A global geometric framework for nonlinear dimensionality reduction. Science 290(5500):2319\u20132323","journal-title":"Science"},{"issue":"2","key":"3095_CR20","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1063\/1.4908014","volume":"25","author":"M Yu","year":"2015","unstructured":"Yu M, Hillebrand A, Tewarie P, Meier J, Dijk B, Van Mieghem P, Stam CJ (2015) Hierarchical clustering in minimum spanning trees. Chaos Interdiscip J Nonlinear Sci 25(2):234","journal-title":"Chaos Interdiscip J Nonlinear Sci"},{"key":"3095_CR21","first-page":"1","volume":"2018","author":"X Lv","year":"2018","unstructured":"Lv X, Ma Y, He X, Huang H, Yang J (2018) Ccimst: a clustering algorithm based on minimum spanning tree and cluster centers. Math Probl Eng 2018:1\u201314","journal-title":"Math Probl Eng"},{"issue":"1","key":"3095_CR22","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1093\/comjnl\/15.1.71","volume":"15","author":"AR Forrest","year":"1972","unstructured":"Forrest AR (1972) Interactive interpolation and approximation by b\u00e9zier polynomials. Comput J 15(1):71\u201379","journal-title":"Comput J"},{"issue":"2","key":"3095_CR23","first-page":"2","volume":"1","author":"G Farin","year":"2002","unstructured":"Farin G (2002) A history of curves and surfaces. Handb Comput Aided Geom Des 1(2):2","journal-title":"Handb Comput Aided Geom Des"}],"container-title":["International Journal of Machine Learning and Cybernetics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s13042-026-03095-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s13042-026-03095-4","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s13042-026-03095-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,24]],"date-time":"2026-04-24T08:44:25Z","timestamp":1777020265000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s13042-026-03095-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,4,24]]},"references-count":23,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2026,6]]}},"alternative-id":["3095"],"URL":"https:\/\/doi.org\/10.1007\/s13042-026-03095-4","relation":{},"ISSN":["1868-8071","1868-808X"],"issn-type":[{"value":"1868-8071","type":"print"},{"value":"1868-808X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,4,24]]},"assertion":[{"value":"14 June 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 April 2026","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 April 2026","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"268"}}