{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,23]],"date-time":"2026-07-23T12:05:42Z","timestamp":1784808342517,"version":"3.55.0"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2026,7,23]],"date-time":"2026-07-23T00:00:00Z","timestamp":1784764800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2026,7,23]],"date-time":"2026-07-23T00:00:00Z","timestamp":1784764800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"name":"Manipal Academy of Higher Education, Manipal"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Quantum Mach. Intell."],"published-print":{"date-parts":[[2026,12]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>Instance selection algorithms for supervised classification and regression tasks in machine learning aim to reduce the size of training datasets whilst maintaining the performance of models by selecting the most important, high-fidelity training labels from a large pool of instances in the original datasets. Traditional instance selection methods such as cluster-based techniques demonstrate enhanced generalization capabilities on fewer data points compared with random sampling approaches, but often suffer from high computational costs, sensitivity to hyperparameters and non-deterministic time complexities. This paper proposes QReduce which is a novel instance selection algorithm which models datasets as N-dimensional graphs with each data point corresponding to a vertex and edges constructed between points in a k-nearest neighbour manner. This graph is subjected to quantum annealing to solve the minimum vertex cover or maximum cut graph combinatorial optimization problems and yield a subgraph representing the reduced subset of instances selected for the reduced dataset. Solving such NP-hard problems are intractable for exact classical solvers on account of combinatorial explosion of the problem\u2019s search space, and quantum annealing was shown to outperform other approximate metaheuristic techniques such as simulated annealing, justifying it as a strong metaheuristic optimization model. QReduce enables recursive reduction of the dataset and has the benefits of less sensitivity to hyperparameters as well as a deterministic time complexity, enabling efficient and effective reduction in storage and compute requirements for training complex machine learning models in the age of green and sustainable AI. Experimental results demonstrate the efficacy of QReduce, outperforming existing instance selection techniques and having the highest average percentage data reduction to percentage accuracy reduction ratios on datasets for both classification and regression tasks, thereby making it a best-in-class instance selection algorithm for selecting high-fidelity training labels in supervised machine learning tasks.<\/jats:p>","DOI":"10.1007\/s42484-026-00422-4","type":"journal-article","created":{"date-parts":[[2026,7,23]],"date-time":"2026-07-23T11:50:40Z","timestamp":1784807440000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["QReduce: A novel quantum annealing approach for graph-based instance selection of high-fidelity training labels in supervised classification and regression datasets"],"prefix":"10.1007","volume":"8","author":[{"given":"Archit","family":"Chadalawada","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0828-1260","authenticated-orcid":false,"given":"Shaleen","family":"Bhatnagar","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,7,23]]},"reference":[{"issue":"2","key":"422_CR1","first-page":"839","volume":"3","author":"ASAJ Akhtar","year":"2020","unstructured":"Akhtar ASAJ, Kanade DM (2020) A review on data reduction techniques. Int J Res Eng Sci Manag 3(2):839\u2013840","journal-title":"Int J Res Eng Sci Manag"},{"key":"422_CR2","doi-asserted-by":"publisher","unstructured":"Alhussein O, Yoo PD, Muhaidat S, Liang J (2019) Semiparametric subsampling and data condensation for large-scale data analytics. In: 2019 IEEE Canadian Conference of Electrical and Computer Engineering (CCECE), pp 1\u20136. IEEE. https:\/\/doi.org\/10.1109\/CCECE.2019.8861966","DOI":"10.1109\/CCECE.2019.8861966"},{"issue":"1","key":"422_CR3","doi-asserted-by":"publisher","first-page":"438","DOI":"10.1515\/jisys-2020-0061","volume":"30","author":"A Amro","year":"2021","unstructured":"Amro A, Al-Akhras M, Hindi KE, Habib M, Shawar BA (2021) Instance reduction for avoiding overfitting in decision trees. J Intell Syst 30(1):438\u2013459. https:\/\/doi.org\/10.1515\/jisys-2020-0061","journal-title":"J Intell Syst"},{"key":"422_CR4","doi-asserted-by":"publisher","unstructured":"Axiotis K, Cohen-Addad V, Henzinger M, Jerome S, Mirrokni V, Saulpic D, Woodruff D, Wunder M (2024) Data-efficient learning via clustering-based sensitivity sampling: Foundation models and beyond. arXiv preprint arXiv:2402.17327, https:\/\/doi.org\/10.48550\/arXiv.2402.17327","DOI":"10.48550\/arXiv.2402.17327"},{"key":"422_CR5","doi-asserted-by":"publisher","unstructured":"Cai J, Macready B, Roy A (2014) A practical heuristic for finding graph minors. arXiv:1406.2741, https:\/\/doi.org\/10.48550\/arXiv.1406.2741","DOI":"10.48550\/arXiv.1406.2741"},{"issue":"6","key":"422_CR6","doi-asserted-by":"publisher","first-page":"561","DOI":"10.1109\/TEVC.2003.819265","volume":"7","author":"JR Cano","year":"2004","unstructured":"Cano JR, Herrera F, Lozano M (2004) Using evolutionary algorithms as instance selection for data reduction in kdd: an experimental study. IEEE Trans Evol Comput 7(6):561\u2013575. https:\/\/doi.org\/10.1109\/TEVC.2003.819265","journal-title":"IEEE Trans Evol Comput"},{"key":"422_CR7","doi-asserted-by":"crossref","unstructured":"Czarnowski I, J\u0119drzejowicz P (2003) An approach to instance reduction in supervised learning. In: International conference on innovative techniques and applications of artificial intelligence, pp 267\u2013280. Springer","DOI":"10.1007\/978-3-540-36562-4_25"},{"key":"422_CR8","unstructured":"Czarnowski I, J\u0119drzejowicz P (2006) Instance reduction approach to machine learning and multi-database mining. Annales Universitatis Mariae Curie-Sk\u0142odowska Sectio AI Informatica 4(1)"},{"issue":"8","key":"422_CR9","doi-asserted-by":"publisher","first-page":"3436","DOI":"10.3390\/app14083436","volume":"14","author":"V Fernandes","year":"2024","unstructured":"Fernandes V, Carvalho G, Pereira V, Bernardino J (2024) Analyzing data reduction techniques: an experimental perspective. Appl Sci 14(8):3436. https:\/\/doi.org\/10.3390\/app14083436","journal-title":"Appl Sci"},{"key":"422_CR10","doi-asserted-by":"publisher","unstructured":"Glover F, Kochenberger G, Du Y (2018) A tutorial on formulating and using qubo models. arXiv preprint arXiv:1811.11538, https:\/\/doi.org\/10.48550\/arXiv.1811.11538","DOI":"10.48550\/arXiv.1811.11538"},{"key":"422_CR11","doi-asserted-by":"publisher","unstructured":"Gupta K, Tayal DK, Jain A (2022) Data reduction techniques in wireless sensor networks. In: 2022 2nd International Conference on Advance Computing and Innovative Technologies in Engineering (ICACITE), pp 38\u201343. IEEE. https:\/\/doi.org\/10.1109\/ICACITE53722.2022.9823775","DOI":"10.1109\/ICACITE53722.2022.9823775"},{"issue":"5","key":"422_CR12","doi-asserted-by":"publisher","first-page":"1878","DOI":"10.1016\/j.patcog.2014.11.005","volume":"48","author":"J Hamidzadeh","year":"2015","unstructured":"Hamidzadeh J, Monsefi R, Yazdi HS (2015) Irahc: instance reduction algorithm using hyperrectangle clustering. Pattern Recogn 48(5):1878\u20131889. https:\/\/doi.org\/10.1016\/j.patcog.2014.11.005","journal-title":"Pattern Recogn"},{"issue":"5","key":"422_CR13","doi-asserted-by":"publisher","first-page":"104198","DOI":"10.1016\/j.ipm.2025.104198","volume":"62","author":"Z Liu","year":"2025","unstructured":"Liu Z, Yu H, Luo X (2025a) A noise-resistant model for graph-based fraud detection. Inf Process Manag 62(5):104198. https:\/\/doi.org\/10.1016\/j.ipm.2025.104198","journal-title":"Inf Process Manag"},{"issue":"6","key":"422_CR14","doi-asserted-by":"publisher","first-page":"5213","DOI":"10.1109\/TCSS.2025.3580834","volume":"12","author":"Z Liu","year":"2025","unstructured":"Liu Z, Gao J, Yu H, Luo X (2025b) A robust graph fraud detection model based on adversarial reweighting. IEEE Trans Comput Soc Syst 12(6):5213\u20135224. https:\/\/doi.org\/10.1109\/TCSS.2025.3580834","journal-title":"IEEE Trans Comput Soc Syst"},{"key":"422_CR15","doi-asserted-by":"publisher","unstructured":"Mazumder AR, Sen A, Sen U (2024) Benchmarking metaheuristic-integrated qaoa against quantum annealing. In: Science and information conference, pp 651\u2013666. Springer. https:\/\/doi.org\/10.48550\/arXiv.2309.16796","DOI":"10.48550\/arXiv.2309.16796"},{"issue":"1","key":"422_CR16","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1007\/s42484-026-00341-4","volume":"8","author":"R Nembrini","year":"2026","unstructured":"Nembrini R, Ferrari Dacrema M, Cremonesi P (2026) Minor embedding for quantum annealing with reinforcement learning. Quantum Machine Intelligence 8(1):15. https:\/\/doi.org\/10.1007\/s42484-026-00341-4","journal-title":"Quantum Machine Intelligence"},{"key":"422_CR17","doi-asserted-by":"publisher","unstructured":"Okanovic P, Waleffe R, Mageirakos V, Nikolakakis KE, Karbasi A, Kalogerias D, G\u00fcrel NM, Rekatsinas T (2023) Repeated random sampling for minimizing the time-to-accuracy of learning. arXiv:2305.18424, https:\/\/doi.org\/10.48550\/arXiv.2305.18424","DOI":"10.48550\/arXiv.2305.18424"},{"issue":"2","key":"422_CR18","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1007\/s10044-008-0142-x","volume":"13","author":"JA Olvera-L\u00f3pez","year":"2010","unstructured":"Olvera-L\u00f3pez JA, Carrasco-Ochoa JA, Mart\u00ednez-Trinidad JF (2010) A new fast prototype selection method based on clustering. Pattern Anal Appl 13(2):131\u2013141. https:\/\/doi.org\/10.1007\/s10044-008-0142-x","journal-title":"Pattern Anal Appl"},{"key":"422_CR20","doi-asserted-by":"publisher","unstructured":"Pelofske E, B\u00e4rtschi A, Eidenbenz S (2023) Quantum annealing vs. qaoa: 127 qubit higher-order ising problems on nisq computers. In: International conference on high performance computing, pp 240\u2013258. Springer. https:\/\/doi.org\/10.1007\/978-3-031-32041-5_13","DOI":"10.1007\/978-3-031-32041-5_13"},{"key":"422_CR19","doi-asserted-by":"publisher","unstructured":"Pelofske E, Hahn G, Djidjev H (2019) Solving large minimum vertex cover problems on a quantum annealer. In: Proceedings of the 16th ACM international conference on computing frontiers, pp 76\u201384. https:\/\/doi.org\/10.1145\/3310273.3321562","DOI":"10.1145\/3310273.3321562"},{"issue":"1","key":"422_CR21","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s13042-014-0232-6","volume":"7","author":"EC Tsang","year":"2016","unstructured":"Tsang EC, Hu Q, Chen D (2016) Feature and instance reduction for pnn classifiers based on fuzzy rough sets. Int J Mach Learn Cybern 7(1):1\u201311. https:\/\/doi.org\/10.1007\/s13042-014-0232-6","journal-title":"Int J Mach Learn Cybern"},{"key":"422_CR22","doi-asserted-by":"publisher","unstructured":"Vodeb J, Er\u017een V, Hrga T, Povh J (2024) Accuracy and performance evaluation of quantum, classical and hybrid solvers for the max-cut problem. arXiv:2412.07460, https:\/\/doi.org\/10.48550\/arXiv.2412.07460","DOI":"10.48550\/arXiv.2412.07460"},{"issue":"7\u20139","key":"422_CR23","doi-asserted-by":"publisher","first-page":"913","DOI":"10.1016\/j.neucom.2005.12.016","volume":"69","author":"X Xu","year":"2006","unstructured":"Xu X, Ma J (2006) An efficient simulated annealing algorithm for the minimum vertex cover problem. Neurocomputing 69(7\u20139):913\u2013916. https:\/\/doi.org\/10.1016\/j.neucom.2005.12.016","journal-title":"Neurocomputing"},{"issue":"24","key":"422_CR24","doi-asserted-by":"publisher","first-page":"13235","DOI":"10.1007\/s00500-019-03865-z","volume":"23","author":"L Yang","year":"2019","unstructured":"Yang L, Zhu Q, Huang J, Wu Q, Cheng D, Hong X (2019) Constraint nearest neighbor for instance reduction. Soft Comput 23(24):13235\u201313245. https:\/\/doi.org\/10.1007\/s00500-019-03865-z","journal-title":"Soft Comput"}],"container-title":["Quantum Machine Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s42484-026-00422-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s42484-026-00422-4","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s42484-026-00422-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,7,23]],"date-time":"2026-07-23T11:50:43Z","timestamp":1784807443000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s42484-026-00422-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,7,23]]},"references-count":24,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2026,12]]}},"alternative-id":["422"],"URL":"https:\/\/doi.org\/10.1007\/s42484-026-00422-4","relation":{},"ISSN":["2524-4906","2524-4914"],"issn-type":[{"value":"2524-4906","type":"print"},{"value":"2524-4914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,7,23]]},"assertion":[{"value":"29 October 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 July 2026","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 July 2026","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"Not applicable.","order":1,"name":"Ethics","label":"Ethical approval and consent to participate","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"All authors consent for this work to be published.","order":2,"name":"Ethics","label":"Consent for publication","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no competing interests.","order":3,"name":"Ethics","label":"Competing interests","group":{"name":"EthicsHeading","label":"Declarations"}}],"article-number":"80"}}