{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,16]],"date-time":"2026-02-16T16:10:10Z","timestamp":1771258210856,"version":"3.50.1"},"reference-count":42,"publisher":"Springer Science and Business Media LLC","issue":"7","license":[{"start":{"date-parts":[[2022,11,2]],"date-time":"2022-11-02T00:00:00Z","timestamp":1667347200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,11,2]],"date-time":"2022-11-02T00:00:00Z","timestamp":1667347200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Neural Comput & Applic"],"published-print":{"date-parts":[[2023,3]]},"DOI":"10.1007\/s00521-022-07974-z","type":"journal-article","created":{"date-parts":[[2022,11,2]],"date-time":"2022-11-02T19:12:35Z","timestamp":1667416355000},"page":"5335-5349","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Unsupervised instance selection via conjectural hyperrectangles"],"prefix":"10.1007","volume":"35","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9679-0403","authenticated-orcid":false,"given":"Fatih","family":"Aydin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,11,2]]},"reference":[{"key":"7974_CR1","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1016\/j.ins.2022.04.036","volume":"602","author":"S Saha","year":"2022","unstructured":"Saha S, Sarker PS, Al SA et al (2022) Cluster-oriented instance selection for classification problems. Inf Sci (Ny) 602:143\u2013158. https:\/\/doi.org\/10.1016\/j.ins.2022.04.036","journal-title":"Inf Sci (Ny)"},{"key":"7974_CR2","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/s10462-010-9165-y","volume":"34","author":"JA Olvera-L\u00f3pez","year":"2010","unstructured":"Olvera-L\u00f3pez JA, Carrasco-Ochoa JA, Mart\u00ednez-Trinidad JF, Kittler J (2010) A review of instance selection methods. Artif Intell Rev 34:133\u2013143. https:\/\/doi.org\/10.1007\/s10462-010-9165-y","journal-title":"Artif Intell Rev"},{"key":"7974_CR3","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1109\/TPAMI.2011.142","volume":"34","author":"S Garcia","year":"2012","unstructured":"Garcia S, Derrac J, Cano JR, Herrera F (2012) Prototype selection for nearest neighbor classification: taxonomy and empirical study. IEEE Trans Pattern Anal Mach Intell 34:417\u2013435. https:\/\/doi.org\/10.1109\/TPAMI.2011.142","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"key":"7974_CR4","doi-asserted-by":"publisher","first-page":"512","DOI":"10.1002\/widm.44","volume":"1","author":"N Garc\u00eda-Pedrajas","year":"2011","unstructured":"Garc\u00eda-Pedrajas N (2011) Evolutionary computation for training set selection. Wiley Interdiscip Rev Data Min Knowl Discov 1:512\u2013523. https:\/\/doi.org\/10.1002\/widm.44","journal-title":"Wiley Interdiscip Rev Data Min Knowl Discov"},{"key":"7974_CR5","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1109\/TIT.1968.1054155","volume":"14","author":"P Hart","year":"1968","unstructured":"Hart P (1968) The condensed nearest neighbor rule (Corresp.). IEEE Trans Inf Theory 14:515\u2013516. https:\/\/doi.org\/10.1109\/TIT.1968.1054155","journal-title":"IEEE Trans Inf Theory"},{"key":"7974_CR6","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1023\/A:1006563312922","volume":"11","author":"E Alpaydin","year":"1997","unstructured":"Alpaydin E (1997) Voting over multiple condensed nearest neighbors. Artif Intell Rev 11:115\u2013132. https:\/\/doi.org\/10.1023\/A:1006563312922","journal-title":"Artif Intell Rev"},{"key":"7974_CR7","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1109\/TIT.1972.1054809","volume":"18","author":"G Gates","year":"1972","unstructured":"Gates G (1972) The reduced nearest neighbor rule (Corresp.). IEEE Trans Inf Theory 18:431\u2013433. https:\/\/doi.org\/10.1109\/TIT.1972.1054809","journal-title":"IEEE Trans Inf Theory"},{"key":"7974_CR8","doi-asserted-by":"publisher","first-page":"541","DOI":"10.1109\/TIT.1974.1055252","volume":"20","author":"J Ullmann","year":"1974","unstructured":"Ullmann J (1974) Automatic selection of reference data for use in a nearest-neighbor method of pattern classification (Corresp.). IEEE Trans Inf Theory 20:541\u2013543. https:\/\/doi.org\/10.1109\/TIT.1974.1055252","journal-title":"IEEE Trans Inf Theory"},{"key":"7974_CR9","doi-asserted-by":"publisher","first-page":"665","DOI":"10.1109\/TIT.1975.1055464","volume":"21","author":"G Ritter","year":"1975","unstructured":"Ritter G, Woodruff H, Lowry S, Isenhour T (1975) An algorithm for a selective nearest neighbor decision rule (Corresp.). IEEE Trans Inf Theory 21:665\u2013669. https:\/\/doi.org\/10.1109\/TIT.1975.1055464","journal-title":"IEEE Trans Inf Theory"},{"key":"7974_CR10","doi-asserted-by":"publisher","first-page":"769","DOI":"10.1109\/TSMC.1976.4309452","volume":"6","author":"I Tomek","year":"1976","unstructured":"Tomek I (1976) Two Modifications of CNN. IEEE Trans Syst Man Cybern SMC 6:769\u2013772. https:\/\/doi.org\/10.1109\/TSMC.1976.4309452","journal-title":"IEEE Trans Syst Man Cybern SMC"},{"key":"7974_CR11","doi-asserted-by":"publisher","first-page":"488","DOI":"10.1109\/TIT.1979.1056066","volume":"25","author":"K Gowda","year":"1979","unstructured":"Gowda K, Krishna G (1979) The condensed nearest neighbor rule using the concept of mutual nearest neighborhood (Corresp.). IEEE Trans Inf Theory 25:488\u2013490. https:\/\/doi.org\/10.1109\/TIT.1979.1056066","journal-title":"IEEE Trans Inf Theory"},{"key":"7974_CR12","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/BF00153759","volume":"6","author":"DW Aha","year":"1991","unstructured":"Aha DW, Kibler D, Albert MK (1991) Instance-based learning algorithms. Mach Learn 6:37\u201366. https:\/\/doi.org\/10.1007\/BF00153759","journal-title":"Mach Learn"},{"key":"7974_CR13","doi-asserted-by":"publisher","first-page":"1450","DOI":"10.1109\/TKDE.2007.190645","volume":"19","author":"F Angiulli","year":"2007","unstructured":"Angiulli F (2007) Fast nearest neighbor condensation for large data sets classification. IEEE Trans Knowl Data Eng 19:1450\u20131464. https:\/\/doi.org\/10.1109\/TKDE.2007.190645","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"7974_CR14","doi-asserted-by":"publisher","first-page":"408","DOI":"10.1109\/TSMC.1972.4309137","volume":"2","author":"DL Wilson","year":"1972","unstructured":"Wilson DL (1972) Asymptotic properties of nearest neighbor rules using edited data. IEEE Trans Syst Man Cybern SMC 2:408\u2013421. https:\/\/doi.org\/10.1109\/TSMC.1972.4309137","journal-title":"IEEE Trans Syst Man Cybern SMC"},{"key":"7974_CR15","doi-asserted-by":"publisher","first-page":"123773","DOI":"10.1109\/ACCESS.2020.3005815","volume":"8","author":"S Zhao","year":"2020","unstructured":"Zhao S, Li J (2020) ELS: a fast parameter-free edition algorithm with natural neighbors-based local sets for k nearest neighbor. IEEE Access 8:123773\u2013123782. https:\/\/doi.org\/10.1109\/ACCESS.2020.3005815","journal-title":"IEEE Access"},{"key":"7974_CR16","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1023\/A:1007626913721","volume":"38","author":"DR Wilson","year":"2000","unstructured":"Wilson DR, Martinez TR (2000) Reduction techniques for instance-based learning algorithms. Mach Learn 38:257\u2013286","journal-title":"Mach Learn"},{"key":"7974_CR17","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1023\/A:1014043630878","volume":"6","author":"H Brighton","year":"2002","unstructured":"Brighton H, Mellish C (2002) Advances in instance selection for instance-based learning algorithms. Data Min Knowl Discov 6:153\u2013172. https:\/\/doi.org\/10.1023\/A:1014043630878","journal-title":"Data Min Knowl Discov"},{"key":"7974_CR18","doi-asserted-by":"publisher","first-page":"1527","DOI":"10.1007\/s10489-019-01598-y","volume":"50","author":"J Li","year":"2020","unstructured":"Li J, Zhu Q, Wu Q (2020) A parameter-free hybrid instance selection algorithm based on local sets with natural neighbors. Appl Intell 50:1527\u20131541. https:\/\/doi.org\/10.1007\/s10489-019-01598-y","journal-title":"Appl Intell"},{"key":"7974_CR19","doi-asserted-by":"publisher","first-page":"410","DOI":"10.1016\/j.artint.2010.01.001","volume":"174","author":"C Garc\u00eda-Osorio","year":"2010","unstructured":"Garc\u00eda-Osorio C, de Haro-Garc\u00eda A, Garc\u00eda-Pedrajas N (2010) Democratic instance selection: a linear complexity instance selection algorithm based on classifier ensemble concepts. Artif Intell 174:410\u2013441. https:\/\/doi.org\/10.1016\/j.artint.2010.01.001","journal-title":"Artif Intell"},{"key":"7974_CR20","doi-asserted-by":"publisher","first-page":"106959","DOI":"10.1016\/j.patcog.2019.07.004","volume":"96","author":"A de Haro-Garc\u00eda","year":"2019","unstructured":"de Haro-Garc\u00eda A, Cerruela-Garc\u00eda G, Garc\u00eda-Pedrajas N (2019) Instance selection based on boosting for instance-based learners. Pattern Recognit 96:106959. https:\/\/doi.org\/10.1016\/j.patcog.2019.07.004","journal-title":"Pattern Recognit"},{"key":"7974_CR21","doi-asserted-by":"publisher","first-page":"561","DOI":"10.1109\/TEVC.2003.819265","volume":"7","author":"JR Cano","year":"2003","unstructured":"Cano JR, Herrera F, Lozano M (2003) Using evolutionary algorithms as instance selection for data reduction in KDD: an experimental study. IEEE Trans Evol Comput 7:561\u2013575. https:\/\/doi.org\/10.1109\/TEVC.2003.819265","journal-title":"IEEE Trans Evol Comput"},{"key":"7974_CR22","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1016\/j.swevo.2018.02.022","volume":"42","author":"A de Haro-Garc\u00eda","year":"2018","unstructured":"de Haro-Garc\u00eda A, P\u00e9rez-Rodr\u00edguez J, Garc\u00eda-Pedrajas N (2018) Combining three strategies for evolutionary instance selection for instance-based learning. Swarm Evol Comput 42:160\u2013172. https:\/\/doi.org\/10.1016\/j.swevo.2018.02.022","journal-title":"Swarm Evol Comput"},{"key":"7974_CR23","doi-asserted-by":"publisher","first-page":"1735","DOI":"10.1007\/s10462-020-09889-4","volume":"54","author":"F Dornaika","year":"2021","unstructured":"Dornaika F (2021) Joint feature and instance selection using manifold data criteria: application to image classification. Artif Intell Rev 54:1735\u20131765. https:\/\/doi.org\/10.1007\/s10462-020-09889-4","journal-title":"Artif Intell Rev"},{"key":"7974_CR24","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1016\/j.neucom.2014.04.078","volume":"150","author":"I Triguero","year":"2015","unstructured":"Triguero I, Peralta D, Bacardit J et al (2015) MRPR: a MapReduce solution for prototype reduction in big data classification. Neurocomputing 150:331\u2013345. https:\/\/doi.org\/10.1016\/j.neucom.2014.04.078","journal-title":"Neurocomputing"},{"key":"7974_CR25","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/j.knosys.2016.05.056","volume":"107","author":"\u00c1 Arnaiz-Gonz\u00e1lez","year":"2016","unstructured":"Arnaiz-Gonz\u00e1lez \u00c1, D\u00edez-Pastor J-F, Rodr\u00edguez JJ, Garc\u00eda-Osorio C (2016) Instance selection of linear complexity for big data. Knowledge-Based Syst 107:83\u201395. https:\/\/doi.org\/10.1016\/j.knosys.2016.05.056","journal-title":"Knowledge-Based Syst"},{"key":"7974_CR26","doi-asserted-by":"publisher","first-page":"106716","DOI":"10.1016\/j.asoc.2020.106716","volume":"97","author":"M Aslani","year":"2020","unstructured":"Aslani M, Seipel S (2020) A fast instance selection method for support vector machines in building extraction. Appl Soft Comput 97:106716. https:\/\/doi.org\/10.1016\/j.asoc.2020.106716","journal-title":"Appl Soft Comput"},{"key":"7974_CR27","doi-asserted-by":"publisher","first-page":"579","DOI":"10.1016\/j.ins.2021.07.015","volume":"577","author":"M Aslani","year":"2021","unstructured":"Aslani M, Seipel S (2021) Efficient and decision boundary aware instance selection for support vector machines. Inf Sci (Ny) 577:579\u2013598. https:\/\/doi.org\/10.1016\/j.ins.2021.07.015","journal-title":"Inf Sci (Ny)"},{"key":"7974_CR28","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1016\/j.knosys.2016.10.031","volume":"116","author":"C Liu","year":"2017","unstructured":"Liu C, Wang W, Wang M et al (2017) An efficient instance selection algorithm to reconstruct training set for support vector machine. Knowledge-Based Syst 116:58\u201373. https:\/\/doi.org\/10.1016\/j.knosys.2016.10.031","journal-title":"Knowledge-Based Syst"},{"key":"7974_CR29","doi-asserted-by":"publisher","first-page":"154581","DOI":"10.1109\/ACCESS.2019.2949238","volume":"7","author":"AA Akinyelu","year":"2019","unstructured":"Akinyelu AA, Ezugwu AE (2019) Nature inspired instance selection techniques for support vector machine speed optimization. IEEE Access 7:154581\u2013154599. https:\/\/doi.org\/10.1109\/ACCESS.2019.2949238","journal-title":"IEEE Access"},{"key":"7974_CR30","doi-asserted-by":"publisher","first-page":"105803","DOI":"10.1016\/j.asoc.2019.105803","volume":"85","author":"JR Rico-Juan","year":"2019","unstructured":"Rico-Juan JR, Valero-Mas JJ, Calvo-Zaragoza J (2019) Extensions to rank-based prototype selection in k-nearest neighbour classification. Appl Soft Comput 85:105803. https:\/\/doi.org\/10.1016\/j.asoc.2019.105803","journal-title":"Appl Soft Comput"},{"key":"7974_CR31","doi-asserted-by":"publisher","first-page":"3009","DOI":"10.1021\/acs.jcim.0c00176","volume":"60","author":"IL Ruiz","year":"2020","unstructured":"Ruiz IL, G\u00f3mez-Nieto M\u00c1 (2020) Prototype selection method based on the rivality and reliability indexes for the improvement of the classification models and external predictions. J Chem Inf Model 60:3009\u20133021. https:\/\/doi.org\/10.1021\/acs.jcim.0c00176","journal-title":"J Chem Inf Model"},{"key":"7974_CR32","doi-asserted-by":"publisher","DOI":"10.1108\/DTA-01-2021-0027","author":"Z Wang","year":"2021","unstructured":"Wang Z, Tsai C-F, Lin W-C (2021) Data cleaning issues in class imbalanced datasets: instance selection and missing values imputation for one-class classifiers. Data Technol Appl. https:\/\/doi.org\/10.1108\/DTA-01-2021-0027","journal-title":"Data Technol Appl"},{"key":"7974_CR33","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1023\/A:1014056429969","volume":"6","author":"H Liu","year":"2002","unstructured":"Liu H, Motoda H (2002) On issues of instance selection. Data Min Knowl Discov 6:115\u2013130. https:\/\/doi.org\/10.1023\/A:1014056429969","journal-title":"Data Min Knowl Discov"},{"key":"7974_CR34","doi-asserted-by":"publisher","first-page":"6894","DOI":"10.1016\/j.eswa.2013.06.053","volume":"40","author":"GDC Cavalcanti","year":"2013","unstructured":"Cavalcanti GDC, Ren TI, Pereira CL (2013) ATISA: adaptive threshold-based instance selection algorithm. Expert Syst Appl 40:6894\u20136900. https:\/\/doi.org\/10.1016\/j.eswa.2013.06.053","journal-title":"Expert Syst Appl"},{"key":"7974_CR35","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/s13042-014-0239-z","volume":"7","author":"J Hamidzadeh","year":"2016","unstructured":"Hamidzadeh J, Monsefi R, Sadoghi Yazdi H (2016) Large symmetric margin instance selection algorithm. Int J Mach Learn Cybern 7:25\u201345. https:\/\/doi.org\/10.1007\/s13042-014-0239-z","journal-title":"Int J Mach Learn Cybern"},{"key":"7974_CR36","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, Sadoghi Yazdi H (2015) IRAHC: instance reduction algorithm using hyperrectangle clustering. Pattern Recognit 48:1878\u20131889. https:\/\/doi.org\/10.1016\/j.patcog.2014.11.005","journal-title":"Pattern Recognit"},{"key":"7974_CR37","doi-asserted-by":"publisher","first-page":"1523","DOI":"10.1016\/j.patcog.2014.10.001","volume":"48","author":"E Leyva","year":"2015","unstructured":"Leyva E, Gonz\u00e1lez A, P\u00e9rez R (2015) Three new instance selection methods based on local sets: a comparative study with several approaches from a bi-objective perspective. Pattern Recognit 48:1523\u20131537. https:\/\/doi.org\/10.1016\/j.patcog.2014.10.001","journal-title":"Pattern Recognit"},{"key":"7974_CR38","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 et al (2019) Constraint nearest neighbor for instance reduction. Soft Comput 23:13235\u201313245. https:\/\/doi.org\/10.1007\/s00500-019-03865-z","journal-title":"Soft Comput"},{"key":"7974_CR39","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/j.ins.2021.12.016","volume":"587","author":"M Kordos","year":"2022","unstructured":"Kordos M, Blachnik M, Scherer R (2022) Fuzzy clustering decomposition of genetic algorithm-based instance selection for regression problems. Inf Sci (Ny) 587:23\u201340. https:\/\/doi.org\/10.1016\/j.ins.2021.12.016","journal-title":"Inf Sci (Ny)"},{"key":"7974_CR40","doi-asserted-by":"publisher","first-page":"107963","DOI":"10.1016\/j.compeleceng.2022.107963","volume":"101","author":"V Herrera-Semenets","year":"2022","unstructured":"Herrera-Semenets V, Hern\u00e1ndez-Le\u00f3n R, van den Berg J (2022) A fast instance reduction algorithm for intrusion detection scenarios. Comput Electr Eng 101:107963. https:\/\/doi.org\/10.1016\/j.compeleceng.2022.107963","journal-title":"Comput Electr Eng"},{"key":"7974_CR41","doi-asserted-by":"publisher","DOI":"10.1007\/s00500-022-07439-4","author":"Y Villuendas-Rey","year":"2022","unstructured":"Villuendas-Rey Y (2022) Hybrid data selection with preservation rough sets. Soft Comput. https:\/\/doi.org\/10.1007\/s00500-022-07439-4","journal-title":"Soft Comput"},{"key":"7974_CR42","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1186\/s40537-022-00640-0","volume":"9","author":"J Zhai","year":"2022","unstructured":"Zhai J, Song D (2022) Optimal instance subset selection from big data using genetic algorithm and open source framework. J Big Data 9:87. https:\/\/doi.org\/10.1186\/s40537-022-00640-0","journal-title":"J Big Data"}],"container-title":["Neural Computing and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-022-07974-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00521-022-07974-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-022-07974-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,10]],"date-time":"2023-02-10T15:13:39Z","timestamp":1676042019000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00521-022-07974-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,11,2]]},"references-count":42,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2023,3]]}},"alternative-id":["7974"],"URL":"https:\/\/doi.org\/10.1007\/s00521-022-07974-z","relation":{},"ISSN":["0941-0643","1433-3058"],"issn-type":[{"value":"0941-0643","type":"print"},{"value":"1433-3058","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,11,2]]},"assertion":[{"value":"10 June 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 October 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 November 2022","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 declared that no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interests"}}]}}