{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,2]],"date-time":"2026-04-02T22:19:37Z","timestamp":1775168377384,"version":"3.50.1"},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2025,3,6]],"date-time":"2025-03-06T00:00:00Z","timestamp":1741219200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2025,3,6]],"date-time":"2025-03-06T00:00:00Z","timestamp":1741219200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100001775","name":"University of Technology Sydney","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100001775","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Quantum Mach. Intell."],"published-print":{"date-parts":[[2025,6]]},"abstract":"<jats:title>Abstract<\/jats:title>\n          <jats:p>The paper proposes the Quantum-SMOTE method, a novel solution that uses quantum computing techniques to solve the prevalent problem of class imbalance in machine learning datasets. Quantum-SMOTE, inspired by the Synthetic Minority Oversampling Technique (SMOTE), generates synthetic data points using quantum processes such as swap tests and quantum rotation. The process varies from the conventional SMOTE algorithm\u2019s usage of K-Nearest Neighbors (KNN) and Euclidean distances, enabling synthetic instances to be generated from minority class data points without relying on neighbor proximity. The algorithm asserts greater control over the synthetic data generation process by introducing hyperparameters such as rotation angle, minority percentage, and splitting factor, which allow for customization to specific dataset requirements. Due to the use of a compact swap test, the algorithm can accommodate a large number of features. Furthermore, the approach is tested on a public dataset of TelecomChurn and evaluated alongside two prominent classification algorithms, Random Forest and Logistic Regression, to determine its impact along with varying proportions of synthetic data.<\/jats:p>","DOI":"10.1007\/s42484-025-00248-6","type":"journal-article","created":{"date-parts":[[2025,3,6]],"date-time":"2025-03-06T11:02:05Z","timestamp":1741258925000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":16,"title":["A quantum approach to synthetic minority oversampling technique (SMOTE)"],"prefix":"10.1007","volume":"7","author":[{"given":"Nishikanta","family":"Mohanty","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bikash K.","family":"Behera","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christopher","family":"Ferrie","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pravat","family":"Dash","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,3,6]]},"reference":[{"key":"248_CR1","doi-asserted-by":"publisher","first-page":"220","DOI":"10.1016\/j.eswa.2016.12.035","volume":"73","author":"G Haixiang","year":"2017","unstructured":"Haixiang G, Yijing L, Shang J, Mingyun G, Yuanyue H, Bing G (2017) Learning from class-imbalanced data: review of methods and applications. Expert Syst Appl 73:220\u2013239. https:\/\/doi.org\/10.1016\/j.eswa.2016.12.035","journal-title":"Expert Syst Appl"},{"key":"248_CR2","doi-asserted-by":"publisher","first-page":"3477","DOI":"10.1016\/j.procs.2021.09.121","volume":"192","author":"M Blaszczyk","year":"2021","unstructured":"Blaszczyk M, Jedrzejowicz J (2021) Framework for imbalanced data classification. Procedia Computer Science. 192:3477\u20133486. https:\/\/doi.org\/10.1016\/j.procs.2021.09.121","journal-title":"Procedia Computer Science."},{"key":"248_CR3","doi-asserted-by":"publisher","unstructured":"Wang S, Dai Y, Shen J, Xuan J (2021) Research on expansion and classification of imbalanced data based on SMOTE algorithm. Scientific Reports 11(1):24039. Number: 1 Publisher: Nature Publishing Group. https:\/\/doi.org\/10.1038\/s41598-021-03430-5","DOI":"10.1038\/s41598-021-03430-5"},{"key":"248_CR4","doi-asserted-by":"publisher","unstructured":"Chawla NV, Bowyer KW, Hall LO, Kegelmeyer WP (2002) SMOTE: synthetic minority over-sampling technique. J Artif Intell Res 16:321\u2013357. https:\/\/doi.org\/10.1613\/jair.953","DOI":"10.1613\/jair.953"},{"key":"248_CR5","doi-asserted-by":"publisher","first-page":"863","DOI":"10.1613\/jair.1.11192","volume":"61","author":"A Fernandez","year":"2018","unstructured":"Fernandez A, Garcia S, Herrera F, Chawla NV (2018) SMOTE for learning from imbalanced data: progress and challenges, marking the 15-year anniversary. J Art Intell Res 61:863\u2013905. https:\/\/doi.org\/10.1613\/jair.1.11192","journal-title":"J Art Intell Res"},{"key":"248_CR6","doi-asserted-by":"publisher","unstructured":"Mukherjee M, Khushi M (2021) SMOTE-ENC: a novel SMOTE-based method to generate synthetic data for nominal and continuous features. Appl Syst Innov 4(1). https:\/\/doi.org\/10.3390\/asi4010018","DOI":"10.3390\/asi4010018"},{"key":"248_CR7","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1109\/TSMCA.2009.2029559","volume":"40","author":"C Seiffert","year":"2010","unstructured":"Seiffert C, Khoshgoftaar TM, Hulse JV, Napolitano A (2010) RUSBoost: a hybrid approach to alleviating class imbalance. IEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans. 40:185\u2013197","journal-title":"IEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans."},{"key":"248_CR8","doi-asserted-by":"crossref","unstructured":"Chawla N, Lazarevic A, Hall L, Bowyer K (2003) SMOTEBoost: improving prediction of the minority class in boosting. 2838:107\u2013119. Available from: https:\/\/link.springer.com\/chapter\/10.1007\/978-3-540-39804-2_12","DOI":"10.1007\/978-3-540-39804-2_12"},{"key":"248_CR9","doi-asserted-by":"publisher","unstructured":"Joloudari JH, Marefat A, Nematollahi MA, Oyelere SS, Hussain S (2023) Effective class-imbalance learning based on SMOTE and convolutional neural networks. Appl Sci 13(6). https:\/\/doi.org\/10.3390\/app13064006","DOI":"10.3390\/app13064006"},{"key":"248_CR10","unstructured":"Telco Customer Churn (2025). Available from: https:\/\/www.kaggle.com\/datasets\/blastchar\/telco-customer-churn"},{"key":"248_CR11","doi-asserted-by":"crossref","unstructured":"Han H, Wang WY, Mao BH (2005) Borderline-SMOTE: a new over-sampling method in imbalanced data sets learning. In: Huang DS, Zhang XP, Huang GB (ed). Advances in Intelligent Computing. Lecture Notes in Computer Science. Berlin, Heidelberg: Springer, pp 878\u2013887. Available from: https:\/\/link.springer.com\/chapter\/10.1007\/11538059_91","DOI":"10.1007\/11538059_91"},{"key":"248_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. Available from: https:\/\/ieeexplore.ieee.org\/document\/4633969","DOI":"10.1109\/IJCNN.2008.4633969"},{"key":"248_CR13","doi-asserted-by":"publisher","unstructured":"Batista GEAPA, Prati RC, Monard MC (2004) A study of the behavior of several methods for balancing machine learning training data. ACM SIGKDD Explorations Newsletter 6(1):20\u201329. https:\/\/doi.org\/10.1145\/1007730.1007735","DOI":"10.1145\/1007730.1007735"},{"key":"248_CR14","doi-asserted-by":"publisher","unstructured":"Two modifications of CNN (1976) IEEE Transactions on Systems, Man, and Cybernetics. SMC-6(11):769\u2013772. https:\/\/doi.org\/10.1109\/TSMC.1976.4309452","DOI":"10.1109\/TSMC.1976.4309452"},{"key":"248_CR15","doi-asserted-by":"crossref","unstructured":"Demidova L, Klyueva I (2017) SVM classification: optimization with the SMOTE algorithm for the class imbalance problem. In: 2017 6th Mediterranean Conference on Embedded Computing (MECO), pp 1\u20134. Available from: https:\/\/ieeexplore.ieee.org\/document\/7977136","DOI":"10.1109\/MECO.2017.7977136"},{"issue":"2","key":"248_CR16","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1109\/TIT.1982.1056489","volume":"28","author":"S Lloyd","year":"1982","unstructured":"Lloyd S (1982) Least squares quantization in PCM. IEEE Trans Inf Theory 28(2):129\u2013137. https:\/\/doi.org\/10.1109\/TIT.1982.1056489","journal-title":"IEEE Trans Inf Theory"},{"key":"248_CR17","unstructured":"Calculate quantum Euclidean distance with qiskit (2022) Medium. Available from: https:\/\/medium.com\/qiskit\/calculate-quantum-euclidean-distance-with-qiskit-df85525ab485"},{"key":"248_CR18","doi-asserted-by":"crossref","unstructured":"Mart\u00ednez-Felipe M, Montiel-P\u00e9rez J, Onofre V, Maldonado-Romo A, Young R (2024) Quantum block-matching algorithm using dissimilarity measure. In: Monti F, Plebani P, Moha N, Paik Hy, Barzen J, Ramachandran G, et\u00a0al (ed). Service-Oriented Computing \u2013 ICSOC 2023 Workshops. Singapore: Springer Nature Singapore, pp 185\u2013196","DOI":"10.1007\/978-981-97-0989-2_15"},{"key":"248_CR19","doi-asserted-by":"publisher","unstructured":"Breiman L (2001Oct) Random forests. Mach Learn 45(1):5\u201332. https:\/\/doi.org\/10.1023\/A:1010933404324","DOI":"10.1023\/A:1010933404324"},{"key":"248_CR20","doi-asserted-by":"crossref","unstructured":"Hosmer Jr, DW, Lemeshow S, Sturdivant RX (2013) Applied logistic regression, 3rd Edition | Wiley. Available from: https:\/\/onlinelibrary.wiley.com\/doi\/book\/10.1002\/9781118548387","DOI":"10.1002\/9781118548387"},{"key":"248_CR21","doi-asserted-by":"publisher","unstructured":"Cover T, Hart P (1967) Nearest neighbor pattern classification. IEEE Trans Inf Theory 13(1):21\u201327. https:\/\/doi.org\/10.1109\/TIT.1967.1053964","DOI":"10.1109\/TIT.1967.1053964"},{"issue":"3","key":"248_CR22","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1080\/00031305.1992.10475879","volume":"46","author":"NS Altman","year":"1992","unstructured":"Altman NS (1992) An introduction to kernel and nearest-neighbor nonparametric regression. Am Stat 46(3):175\u2013185. https:\/\/doi.org\/10.1080\/00031305.1992.10475879","journal-title":"Am Stat"},{"key":"248_CR23","doi-asserted-by":"publisher","unstructured":"Blagus R, Lusa L (2013 Mar) SMOTE for high-dimensional class-imbalanced data. BMC Bioinformatics 14(1):106. https:\/\/doi.org\/10.1186\/1471-2105-14-106","DOI":"10.1186\/1471-2105-14-106"}],"container-title":["Quantum Machine Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s42484-025-00248-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s42484-025-00248-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s42484-025-00248-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,26]],"date-time":"2025-06-26T14:40:52Z","timestamp":1750948852000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s42484-025-00248-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,3,6]]},"references-count":23,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2025,6]]}},"alternative-id":["248"],"URL":"https:\/\/doi.org\/10.1007\/s42484-025-00248-6","relation":{},"ISSN":["2524-4906","2524-4914"],"issn-type":[{"value":"2524-4906","type":"print"},{"value":"2524-4914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,3,6]]},"assertion":[{"value":"26 June 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 January 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 March 2025","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 have no financial or non-financial competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"38"}}