{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,16]],"date-time":"2026-05-16T01:30:01Z","timestamp":1778895001899,"version":"3.51.4"},"reference-count":48,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2010,5,27]],"date-time":"2010-05-27T00:00:00Z","timestamp":1274918400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Artif Intell Rev"],"published-print":{"date-parts":[[2010,8]]},"DOI":"10.1007\/s10462-010-9165-y","type":"journal-article","created":{"date-parts":[[2010,5,25]],"date-time":"2010-05-25T19:46:39Z","timestamp":1274816799000},"page":"133-143","source":"Crossref","is-referenced-by-count":288,"title":["A review of instance selection methods"],"prefix":"10.1007","volume":"34","author":[{"given":"J. Arturo","family":"Olvera-L\u00f3pez","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J. Ariel","family":"Carrasco-Ochoa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J. Francisco","family":"Mart\u00ednez-Trinidad","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Josef","family":"Kittler","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2010,5,27]]},"reference":[{"key":"9165_CR1","first-page":"37","volume":"6","author":"DW Aha","year":"1991","unstructured":"Aha DW, Kibler D, Albert MK (1991) Instance-based learning algorithms. Mach Learn 6: 37\u201366","journal-title":"Mach Learn"},{"issue":"12","key":"9165_CR2","doi-asserted-by":"crossref","first-page":"1445","DOI":"10.1002\/int.1068","volume":"16","author":"JC Bezdek","year":"2001","unstructured":"Bezdek JC, Kuncheva LI (2001) Nearest prototype classifier designs: an experimental study. Int J Hybrid Intell Syst 16(12): 1445\u20131473","journal-title":"Int J Hybrid Intell Syst"},{"issue":"2","key":"9165_CR3","doi-asserted-by":"crossref","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(2): 153\u2013172","journal-title":"Data Min Knowl Discov"},{"key":"9165_CR4","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1016\/S0004-3702(97)00063-5","volume":"97","author":"AL Blum","year":"1997","unstructured":"Blum AL, Langley P (1997) Selection of relevant features and examples in machine learning. Artif Intell 97: 245\u2013271","journal-title":"Artif Intell"},{"key":"9165_CR5","first-page":"17","volume-title":"IDEAL 2009, LNCS 5788","author":"Y Caises","year":"2009","unstructured":"Caises Y, Gonz\u00e1lez A, Leyva E, P\u00e9rez R (2009) SCIS: combining instance selection methods to increase their effectiveness over a wide range of domains. In: Corchado E, Yin H (eds) IDEAL 2009, LNCS 5788. Burgos, Spain, pp 17\u201324"},{"key":"9165_CR6","doi-asserted-by":"crossref","first-page":"953","DOI":"10.1016\/j.patrec.2004.09.043","volume":"26","author":"JR Cano","year":"2005","unstructured":"Cano JR, Herrera F, Lozano M (2005) Stratification for scaling up evolutionary prototype selection. Pattern Recognit Lett 26: 953\u2013963","journal-title":"Pattern Recognit Lett"},{"issue":"6","key":"9165_CR7","doi-asserted-by":"crossref","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(6): 561\u2013575","journal-title":"IEEE Trans Evol Comput"},{"issue":"3","key":"9165_CR8","doi-asserted-by":"crossref","first-page":"408","DOI":"10.1109\/3477.931531","volume":"31","author":"V Cerver\u00f3n","year":"2001","unstructured":"Cerver\u00f3n V, Ferri FJ (2001) Another move toward the minimum consistent subset: a tabu search approach to the condensed nearest neighbour rule. IEEE Trans Syst Man Cybern B 31(3): 408\u2013413","journal-title":"IEEE Trans Syst Man Cybern B"},{"key":"9165_CR9","doi-asserted-by":"crossref","unstructured":"Chien-Hsing C, Bo-Han K, Fu C (2006) The generalized condensed nearest neighbor rule as a data reduction method. In: Proceedings of the 18th international conference on pattern recognition. IEEE Computer Society, Hong-Kong, pp 556\u2013559","DOI":"10.1109\/ICPR.2006.1119"},{"key":"9165_CR10","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1109\/TIT.1967.1053964","volume":"13","author":"T Cover","year":"1967","unstructured":"Cover T, Hart P (1967) Nearest neighbor pattern classification. IEEE Trans Inf Theory 13: 21\u201327","journal-title":"IEEE Trans Inf Theory"},{"key":"9165_CR11","doi-asserted-by":"crossref","first-page":"392","DOI":"10.1007\/s10618-008-0121-2","volume":"18","author":"A De Haro-Garc\u00eda","year":"2009","unstructured":"De Haro-Garc\u00eda A, Garc\u00eda-Pedrajas N (2009) A divide-and-conquer approach for scaling up instance sele ction algorithm. Data Min Knowl Discov 18: 392\u2013418","journal-title":"Data Min Knowl Discov"},{"key":"9165_CR12","unstructured":"Devijver PA, Kittler J (1980) On the edited nearest neighbor rule. In: Proceedings of the 5th international conference on pattern recognition. Los Alamitos, CA, pp 72\u201380"},{"issue":"3","key":"9165_CR13","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1145\/355744.355745","volume":"3","author":"JH Friedman","year":"1997","unstructured":"Friedman JH, Bentley JL, Finkel RA (1997) An algorithm for finding best matches in logarithmic expected time. ACM Trans Math Softw 3(3): 209\u2013226","journal-title":"ACM Trans Math Softw"},{"key":"9165_CR14","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1007\/s10044-008-0106-1","volume":"11","author":"U Garain","year":"2008","unstructured":"Garain U (2008) Prototype reduction using an artificial immune model. Pattern Anal Appl 11: 353\u2013363","journal-title":"Pattern Anal Appl"},{"key":"9165_CR15","doi-asserted-by":"crossref","first-page":"2693","DOI":"10.1016\/j.patcog.2008.02.006","volume":"41","author":"S Garc\u00eda","year":"2008","unstructured":"Garc\u00eda S, Cano JR, Herera F (2008) A memetic algorithm for evolutionary prototype selection: a scaling up approach. Pattern Recognit 41: 2693\u20132709","journal-title":"Pattern Recognit"},{"issue":"4","key":"9165_CR16","doi-asserted-by":"crossref","first-page":"563","DOI":"10.1016\/0305-0548(86)90050-X","volume":"13","author":"F Glover","year":"1986","unstructured":"Glover F (1986) The general employee scheduling problem: an integration of management science and artificial intelligence. Comput Oper Res 13(4): 563\u2013593","journal-title":"Comput Oper Res"},{"key":"9165_CR17","first-page":"580","volume-title":"ICAISC 2004, LNAI","author":"M Grochowski","year":"2004","unstructured":"Grochowski M, Jankowski N et\u00a0al (2004) Comparison of instance selection algorithms II. In: Results , comments. Rutkowski L (eds) ICAISC 2004, LNAI. Zacopane, Poland, pp 580\u2013585"},{"key":"9165_CR18","doi-asserted-by":"crossref","first-page":"515","DOI":"10.1109\/TIT.1968.1054155","volume":"14","author":"PE Hart","year":"1968","unstructured":"Hart PE (1968) The condensed nearest neighbor rule. IEEE Trans Inf Theory 14: 515\u2013516","journal-title":"IEEE Trans Inf Theory"},{"key":"9165_CR19","doi-asserted-by":"crossref","unstructured":"Ke-Ping Z, Shui-Geng Z, Ji-Hong G, Ao-Ying A (2003) C-Pruner: An improved instance pruning algorithm. In: Proceedings of 2nd IEEE international conference on machine learning and cybernetics, vol 1. pp 94\u201399","DOI":"10.1109\/ICMLC.2003.1264449"},{"key":"9165_CR20","first-page":"203","volume-title":"Handbook of pattern recognition and image processing","author":"J Kittler","year":"1986","unstructured":"Kittler J (1986) Feature selection and extraction. In: Young TY, Fu KS (eds) Handbook of pattern recognition and image processing. Academic Press, New York, pp 203\u2013217"},{"key":"9165_CR21","doi-asserted-by":"crossref","first-page":"809","DOI":"10.1016\/0167-8655(95)00047-K","volume":"16","author":"LI Kuncheva","year":"1995","unstructured":"Kuncheva LI (1995) Editing for the k-nearest neighbors rule by a genetic algorithm. Pattern Recognit Lett 16: 809\u2013814","journal-title":"Pattern Recognit Lett"},{"key":"9165_CR22","doi-asserted-by":"crossref","first-page":"1041","DOI":"10.1016\/S0031-3203(96)00134-3","volume":"30","author":"LI Kuncheva","year":"1997","unstructured":"Kuncheva LI (1997) Fitness functions in editing k-NN referent set by genetic algorithms. Pattern Recognit 30: 1041\u20131049","journal-title":"Pattern Recognit"},{"issue":"1","key":"9165_CR23","doi-asserted-by":"crossref","first-page":"160","DOI":"10.1109\/5326.661099","volume":"28","author":"LI Kuncheva","year":"1998","unstructured":"Kuncheva LI, Bezdek JC (1998) Nearest prototype classification, clustering, genetic algorithms, or random search?. IEEE Trans Syst Man Cybern C 28(1): 160\u2013164","journal-title":"IEEE Trans Syst Man Cybern C"},{"key":"9165_CR24","doi-asserted-by":"crossref","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","journal-title":"Data Min Knowl Discov"},{"key":"9165_CR25","doi-asserted-by":"crossref","first-page":"495","DOI":"10.1016\/j.patcog.2005.11.004","volume":"39","author":"A Lumini","year":"2006","unstructured":"Lumini A, Nanni L (2006) A clustering method for automatic biometric template selection. Pattern Recognit 39: 495\u2013497","journal-title":"Pattern Recognit"},{"key":"9165_CR26","doi-asserted-by":"crossref","first-page":"2771","DOI":"10.1016\/S0031-3203(01)00208-4","volume":"35","author":"RA Mollineda","year":"2002","unstructured":"Mollineda RA, Ferri FJ, Vidal E (2002) An efficient prototype merging strategy for the condensed 1-NN rule through class-conditional hierarchical clustering. Pattern Recognit 35: 2771\u20132782","journal-title":"Pattern Recognit"},{"key":"9165_CR27","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1016\/j.patrec.2005.08.015","volume":"27","author":"BL Narayan","year":"2006","unstructured":"Narayan BL, Murthy CA, Pal SK (2006) Maxdiff kd-trees for data condensation. Pattern Recognit Lett 27: 187\u2013200","journal-title":"Pattern Recognit Lett"},{"key":"9165_CR28","first-page":"280","volume-title":"LNCS 3578: IDEAL 2005","author":"JA Olvera-L\u00f3pez","year":"2005","unstructured":"Olvera-L\u00f3pez JA, Carrasco-Ochoa JA, Mart\u00ednez-Trinidad JF (2005) Sequential search for decremental edition. In: Gallagher M, Hogan J, Maire F (eds) LNCS 3578: IDEAL 2005. Queensland, Australia, pp 280\u2013285"},{"key":"9165_CR29","first-page":"694","volume-title":"MLDM 2007:LNAI 4571","author":"JA Olvera-L\u00f3pez","year":"2007","unstructured":"Olvera-L\u00f3pez JA, Mart\u00ednez-Trinidad JF, Carrasco-Ochoa JA (2007a) Restricted sequential floating search applied to object selection. In: Perner P (eds) MLDM 2007:LNAI 4571. Leipzig, Germany, pp 694\u2013702"},{"key":"9165_CR30","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1007\/978-3-540-75175-5_4","volume-title":"Computer recognition systems 2, ASC 45","author":"JA Olvera-L\u00f3pez","year":"2007","unstructured":"Olvera-L\u00f3pez JA, Carrasco-Ochoa JA, Mart\u00ednez-Trinidad JF et\u00a0al (2007) Object selection based on clustering and border objects. In: Kurzynski M (eds) Computer recognition systems 2, ASC 45. Wroclaw, Poland, pp 27\u201334"},{"key":"9165_CR31","first-page":"153","volume-title":"CIARP 2008, LNCS 5197","author":"JA Olvera-L\u00f3pez","year":"2008","unstructured":"Olvera-L\u00f3pez JA, Carrasco-Ochoa JA, Mart\u00ednez-Trinidad JF (2008) Prototype selection via prototype relevance. In: Ruiz-Shulcloper J, Kropatsch WG (eds) CIARP 2008, LNCS 5197. Habana, Cuba, pp 153\u2013160"},{"issue":"4","key":"9165_CR32","doi-asserted-by":"crossref","first-page":"599","DOI":"10.3233\/IDA-2009-0383","volume":"13","author":"JA Olvera-L\u00f3pez","year":"2009","unstructured":"Olvera-L\u00f3pez JA, Mart\u00ednez-Trinidad JF, Carrasco-Ochoa JA, Kittler J (2009) Prototype selection based on sequeintial search. Intell Data Anal 13(4): 599\u2013631","journal-title":"Intell Data Anal"},{"key":"9165_CR33","doi-asserted-by":"crossref","unstructured":"Paredes R, Vidal E (2000) Weighting prototypes. A new editing approach. In: Proceedings of the international conference on pattern recognition ICPR, vol. 2. pp 25\u201328","DOI":"10.1109\/ICPR.2000.906011"},{"key":"9165_CR34","doi-asserted-by":"crossref","unstructured":"Pudil P, Ferri FJ, Novovicov\u00e1 J, Kittler J (1994) Floating search methods for feature selection with nonmonotonic criterion functions. In: Proceedings of the 12th international conference on pattern recognition. IEEE Computer Society Press, pp 279\u2013283","DOI":"10.1109\/ICPR.1994.576920"},{"issue":"10","key":"9165_CR35","doi-asserted-by":"crossref","first-page":"1554","DOI":"10.1016\/j.patrec.2005.01.003","volume":"26","author":"T Raicharoen","year":"2005","unstructured":"Raicharoen T, Lursinsap C (2005) A divide-and-conquer approach to the pairwise opposite class-nearest neighbor (POC-NN) algorithm. Pattern Recognit Lett 26(10): 1554\u20131567","journal-title":"Pattern Recognit Lett"},{"issue":"6","key":"9165_CR36","doi-asserted-by":"crossref","first-page":"665","DOI":"10.1109\/TIT.1975.1055464","volume":"21","author":"GL Ritter","year":"1975","unstructured":"Ritter GL, Woodruff HB, Lowry SR, Isenhour TL (1975) An algorithm for a selective nearest neighbor decision rule. IEEE Trans Inf Theory 21(6): 665\u2013669","journal-title":"IEEE Trans Inf Theory"},{"key":"9165_CR37","doi-asserted-by":"crossref","first-page":"1009","DOI":"10.1016\/S0031-3203(02)00119-X","volume":"36","author":"JC Riquelme","year":"2003","unstructured":"Riquelme JC, Aguilar-Ru\u00edz JS, Toro M (2003) Finding representative patterns with ordered projections. Pattern Recognit 36: 1009\u20131018","journal-title":"Pattern Recognit"},{"key":"9165_CR38","first-page":"975","volume-title":"PRICAI 2006:LNAI 4099","author":"A Srisawat","year":"2006","unstructured":"Srisawat A, Phienthrakul T, Kijsirikul B (2006) SV-kNNC: an algorithm for improving the efficency of k-Nearest neighbr. In: Yang Q, Webb G (eds) PRICAI 2006:LNAI 4099. Guilin, China, pp 975\u2013979"},{"key":"9165_CR39","doi-asserted-by":"crossref","unstructured":"Spillmann B, Neuhaus M, Bunke H, P\u0229kalska E, Duin RPW (2006) Transforming strings to vector spaces using prototype selection. In: Yeung D-Y et\u00a0al (eds) SSPR&SPR 2006, LNCS 4109. Hong-Kong, pp. 287\u2013296","DOI":"10.1007\/11815921_31"},{"key":"9165_CR40","first-page":"448","volume":"6-6","author":"I Tomek","year":"1976","unstructured":"Tomek I (1976) An experiment with the edited nearest-neighbor rule. IEEE Trans Syst Man Cybern 6-6: 448\u2013452","journal-title":"IEEE Trans Syst Man Cybern"},{"key":"9165_CR41","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-2440-0","volume-title":"The nature of statistical learning theory","author":"V Vapnik","year":"1995","unstructured":"Vapnik V (1995) The nature of statistical learning theory. Springer, New York"},{"key":"9165_CR42","first-page":"35","volume-title":"IbPRIA 2005, LNCS 3523","author":"F V\u00e1zquez","year":"2005","unstructured":"V\u00e1zquez F, S\u00e1nchez S, Pla F et\u00a0al (2005) A stochastic approach to Wilson\u2019s editing algorithm. In: Marques JS (eds) IbPRIA 2005, LNCS 3523. Estoril, Portugal, pp 35\u201342"},{"issue":"9","key":"9165_CR43","doi-asserted-by":"crossref","first-page":"1417","DOI":"10.1109\/TPAMI.2005.187","volume":"27","author":"CJ Venmann","year":"2005","unstructured":"Venmann CJ, Reinders MJT (2005) The nearest sub-class classifier: a compromise between the nearest mean and nearest neighbor classifier. IEEE Trans Pattern Anal Mach Intell 27(9): 1417\u20131429","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"issue":"9","key":"9165_CR44","doi-asserted-by":"crossref","first-page":"1273","DOI":"10.1109\/TPAMI.2002.1033218","volume":"24","author":"CJ Venmann","year":"2002","unstructured":"Venmann CJ, Reinders MJT, Backer E (2002) A maximum variance clustering algorithm. IEEE Trans Pattern Anal Mach Intell 24(9): 1273\u20131280","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"key":"9165_CR45","doi-asserted-by":"crossref","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 2: 408\u2013421","journal-title":"IEEE Trans Syst Man Cybern"},{"key":"9165_CR46","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1023\/A:1007626913721","volume":"38","author":"DR Wilson","year":"2000","unstructured":"Wilson DR, Mart\u00ednez TR (2000) Reduction techniques for instance-based learning algorithms. Mach Learn 38: 257\u2013286","journal-title":"Mach Learn"},{"key":"9165_CR47","first-page":"528","volume-title":"ICNC 2005, LNCS 3610","author":"L Yuangui","year":"2005","unstructured":"Yuangui L, Zhonhui H, Yunze C, Weidong Z et\u00a0al (2005) Support vector based prototype selection method for nearest neighbor rules. In: Wang L (eds) ICNC 2005, LNCS 3610. Changsha, China, pp 528\u2013535"},{"key":"9165_CR48","doi-asserted-by":"crossref","first-page":"1481","DOI":"10.1016\/S0031-3203(01)00137-6","volume":"35","author":"H Zhang","year":"2002","unstructured":"Zhang H, Sun G (2002) Optimal reference subset selection for nearest neighbor classification by tabu search. Pattern Recognit 35: 1481\u20131490","journal-title":"Pattern Recognit"}],"container-title":["Artificial Intelligence Review"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10462-010-9165-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10462-010-9165-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10462-010-9165-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T13:45:08Z","timestamp":1559137508000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10462-010-9165-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,5,27]]},"references-count":48,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2010,8]]}},"alternative-id":["9165"],"URL":"https:\/\/doi.org\/10.1007\/s10462-010-9165-y","relation":{},"ISSN":["0269-2821","1573-7462"],"issn-type":[{"value":"0269-2821","type":"print"},{"value":"1573-7462","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,5,27]]}}}