{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,27]],"date-time":"2025-10-27T20:41:34Z","timestamp":1761597694047,"version":"3.37.3"},"reference-count":37,"publisher":"Springer Science and Business Media LLC","issue":"9","license":[{"start":{"date-parts":[[2016,3,26]],"date-time":"2016-03-26T00:00:00Z","timestamp":1458950400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100003176","name":"Ministerio de Educaci\u01ffn, Cultura y Deporte","doi-asserted-by":"publisher","award":["FPU-AP20120939"],"award-info":[{"award-number":["FPU-AP20120939"]}],"id":[{"id":"10.13039\/501100003176","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003329","name":"Ministerio de Econom\u00eda y Competitividad","doi-asserted-by":"publisher","award":["TIN2013-48152-C2-1-R"],"award-info":[{"award-number":["TIN2013-48152-C2-1-R"]}],"id":[{"id":"10.13039\/501100003329","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Neural Comput &amp; Applic"],"published-print":{"date-parts":[[2017,9]]},"DOI":"10.1007\/s00521-016-2278-8","type":"journal-article","created":{"date-parts":[[2016,3,26]],"date-time":"2016-03-26T08:46:28Z","timestamp":1458981988000},"page":"2415-2424","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":17,"title":["Prototype generation on structural data using dissimilarity space representation"],"prefix":"10.1007","volume":"28","author":[{"given":"Jorge","family":"Calvo-Zaragoza","sequence":"first","affiliation":[]},{"given":"Jose J.","family":"Valero-Mas","sequence":"additional","affiliation":[]},{"given":"Juan R.","family":"Rico-Juan","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,3,26]]},"reference":[{"key":"2278_CR1","doi-asserted-by":"crossref","first-page":"74","DOI":"10.1016\/j.patrec.2013.09.014","volume":"36","author":"J Abreu","year":"2014","unstructured":"Abreu J, Rico-Juan JR (2014) A new iterative algorithm for computing a quality approximated median of strings based on edit operations. Pattern Recognit Lett 36:74\u201380","journal-title":"Pattern Recognit Lett"},{"issue":"11","key":"2278_CR2","doi-asserted-by":"crossref","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(11):1450\u20131464","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"2278_CR3","unstructured":"Arthur D, Vassilvitskii S (2007) K-means++: the advantages of careful seeding. In: Proceedings of the eighteenth annual ACM-SIAM symposium on discrete algorithms, SODA \u201907Society for Industrial and Applied Mathematics, Philadelphia, PA, USA, pp 1027\u20131035"},{"issue":"6","key":"2278_CR4","doi-asserted-by":"crossref","first-page":"1648","DOI":"10.1016\/j.patcog.2012.11.020","volume":"46","author":"EZ Borzeshi","year":"2013","unstructured":"Borzeshi EZ, Piccardi M, Riesen K, Bunke H (2013) Discriminative prototype selection methods for graph embedding. Pattern Recognit 46(6):1648\u20131657","journal-title":"Pattern Recognit"},{"issue":"7","key":"2278_CR5","doi-asserted-by":"crossref","first-page":"811","DOI":"10.1016\/j.patrec.2011.04.017","volume":"33","author":"H Bunke","year":"2012","unstructured":"Bunke H, Riesen K (2012) Towards the unification of structural and statistical pattern recognition. Pattern Recognit Lett 33(7):811\u2013825","journal-title":"Pattern Recognit Lett"},{"key":"2278_CR6","doi-asserted-by":"crossref","unstructured":"Calvo-Zaragoza J, Oncina J (2014) Recognition of pen-based music notation: the HOMUS dataset. In: Proceedings of the 22nd international conference on pattern recognition, ICPR, pp 3038\u20133043","DOI":"10.1109\/ICPR.2014.524"},{"issue":"5","key":"2278_CR7","doi-asserted-by":"crossref","first-page":"1608","DOI":"10.1016\/j.patcog.2014.11.015","volume":"48","author":"J Calvo-Zaragoza","year":"2015","unstructured":"Calvo-Zaragoza J, Valero-Mas JJ, Rico-Juan JR (2015) Improving kNN multi-label classification in prototype selection scenarios using class proposals. Pattern Recognit 48(5):1608\u20131622","journal-title":"Pattern Recognit"},{"key":"2278_CR8","first-page":"72","volume-title":"7th Iberian conference on pattern recognition and image analysis (IbPRIA)","author":"J Calvo-Zaragoza","year":"2015","unstructured":"Calvo-Zaragoza J, Valero-Mas JJ, Rico-Juan JR (2015) Prototype generation on structural data using dissimilarity space representation: a case of study. In: Paredes R, Cardoso JS, Pardo XM (eds) 7th Iberian conference on pattern recognition and image analysis (IbPRIA). Springer, Santiago de Compostela, pp 72\u201382"},{"issue":"3","key":"2278_CR9","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1016\/j.asoc.2005.02.006","volume":"6","author":"JR Cano","year":"2006","unstructured":"Cano JR, Herrera F, Lozano M (2006) On the combination of evolutionary algorithms and stratified strategies for training set selection in data mining. Appl Soft Comput 6(3):323\u2013332","journal-title":"Appl Soft Comput"},{"issue":"2","key":"2278_CR10","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1016\/S0031-3203(96)00072-6","volume":"30","author":"C Decaestecker","year":"1997","unstructured":"Decaestecker C (1997) Finding prototypes for nearest neighbour classification by means of gradient descent and deterministic annealing. Pattern Recognit 30(2):281\u2013288","journal-title":"Pattern Recognit"},{"key":"2278_CR11","first-page":"1","volume":"7","author":"J Demsar","year":"2006","unstructured":"Demsar J (2006) Statistical comparisons of classifiers over multiple data sets. J Mach Learn Res 7:1\u201330","journal-title":"J Mach Learn Res"},{"key":"2278_CR12","volume-title":"Pattern classification","author":"RO Duda","year":"2001","unstructured":"Duda RO, Hart PE, Stork DG (2001) Pattern classification. Wiley, New York"},{"issue":"7","key":"2278_CR13","doi-asserted-by":"crossref","first-page":"826","DOI":"10.1016\/j.patrec.2011.04.019","volume":"33","author":"RPW Duin","year":"2012","unstructured":"Duin RPW, Pekalska E (2012) The dissimilarity space: bridging structural and statistical pattern recognition. Pattern Recognit Lett 33(7):826\u2013832","journal-title":"Pattern Recognit Lett"},{"key":"2278_CR14","unstructured":"Eshelman LJ (1990) The CHC adaptive search algorithm: how to have safe search when engaging in nontraditional genetic recombination. In: Proceedings of the first workshop on foundations of genetic algorithms, Indiana, USA, pp 265\u2013283"},{"issue":"4","key":"2278_CR15","doi-asserted-by":"crossref","first-page":"431","DOI":"10.1023\/B:HEUR.0000034715.70386.5b","volume":"10","author":"F Fern\u00e1ndez","year":"2004","unstructured":"Fern\u00e1ndez F, Isasi P (2004) Evolutionary design of nearest prototype classifiers. J Heuristics 10(4):431\u2013454","journal-title":"J Heuristics"},{"key":"2278_CR16","doi-asserted-by":"crossref","unstructured":"Ferrer M, Bunke H (2010) An iterative algorithm for approximate median graph computation. In: Pattern recognition (ICPR), 20th international conference on, pp 1562\u20131565","DOI":"10.1109\/ICPR.2010.386"},{"key":"2278_CR17","doi-asserted-by":"crossref","unstructured":"Freeman H (1961) On the encoding of arbitrary geometric configurations. Electron Comput IRE Trans EC-10(2):260\u2013268","DOI":"10.1109\/TEC.1961.5219197"},{"issue":"3","key":"2278_CR18","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1109\/TPAMI.2011.142","volume":"34","author":"S Garcia","year":"2012","unstructured":"Garcia S, Derrac J, Cano J, Herrera F (2012) Prototype selection for nearest neighbor classification: taxonomy and empirical study. IEEE Trans Pattern Anal Mach Intell 34(3):417\u2013435","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"key":"2278_CR19","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-319-10247-4","volume-title":"Data preprocessing in data mining","author":"S Garc\u00eda","year":"2015","unstructured":"Garc\u00eda S, Luengo J, Herrera F (2015) Data preprocessing in data mining. Springer, Berlin"},{"key":"2278_CR20","doi-asserted-by":"crossref","first-page":"342","DOI":"10.1016\/j.knosys.2014.04.021","volume":"67","author":"N Garc\u00eda-Pedrajas","year":"2014","unstructured":"Garc\u00eda-Pedrajas N, De Haro-Garc\u00eda A (2014) Boosting instance selection algorithms. Knowl Based Syst 67:342\u2013360","journal-title":"Knowl Based Syst"},{"issue":"3","key":"2278_CR21","doi-asserted-by":"crossref","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 Inform Theory 14(3):515\u2013516","journal-title":"IEEE Trans Inform Theory"},{"issue":"1\u20132","key":"2278_CR22","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1016\/S0304-3975(97)00240-5","volume":"230","author":"C Higuera de la","year":"2000","unstructured":"de la Higuera C, Casacuberta F (2000) Topology of strings: median string is NP-complete. Theor Comput Sci 230(1\u20132):39\u201348","journal-title":"Theor Comput Sci"},{"issue":"5","key":"2278_CR23","doi-asserted-by":"crossref","first-page":"530","DOI":"10.1109\/TPAMI.2003.1195989","volume":"25","author":"G Hjaltason","year":"2003","unstructured":"Hjaltason G, Samet H (2003) Properties of embedding methods for similarity searching in metric spaces. Pattern Anal Mach Intell IEEE Trans 25(5):530\u2013549","journal-title":"Pattern Anal Mach Intell IEEE Trans"},{"issue":"5","key":"2278_CR24","doi-asserted-by":"crossref","first-page":"550","DOI":"10.1109\/34.291440","volume":"16","author":"J Hull","year":"1994","unstructured":"Hull J (1994) A database for handwritten text recognition research. IEEE Trans Pattern Anal 16(5):550\u2013554","journal-title":"IEEE Trans Pattern Anal"},{"issue":"12","key":"2278_CR25","first-page":"4091","volume":"1","author":"SB Kotsiantis","year":"2007","unstructured":"Kotsiantis SB, Kanellopoulos D, Pintelas PE (2007) Data preprocessing for supervised learning. Int J Comput Electr Autom Control Inf Eng 1(12):4091\u20134096","journal-title":"Int J Comput Electr Autom Control Inf Eng"},{"key":"2278_CR26","doi-asserted-by":"crossref","unstructured":"Latecki LJ, Lakmper R, Eckhardt U (2000) Shape descriptors for non-rigid shapes with a single closed contour. In: Proceedings of IEEE conference computer vision and pattern recognition, pp 424\u2013429","DOI":"10.1109\/CVPR.2000.855850"},{"key":"2278_CR27","first-page":"306","volume-title":"Intelligent signal processing","author":"Y LeCun","year":"2001","unstructured":"LeCun Y, Bottou L, Bengio Y, Haffner P (2001) Gradient-based learning applied to document recognition. In: Haykin S, Kosko B (eds) Intelligent signal processing. IEEE Press, Piscataway, NJ, USA, pp 306\u2013351"},{"key":"2278_CR28","volume-title":"Machine learning","author":"TM Mitchell","year":"1997","unstructured":"Mitchell TM (1997) Machine learning. McGraw-Hill Inc, NY"},{"issue":"9","key":"2278_CR29","doi-asserted-by":"publisher","first-page":"11820","DOI":"10.1016\/j.eswa.2011.03.070","volume":"38","author":"L Nanni","year":"2011","unstructured":"Nanni L, Lumini A (2011) Prototype reduction techniques: a comparison among different approaches. Expert Syst Appl 38(9):11820\u201311828. doi: 10.1016\/j.eswa.2011.03.070","journal-title":"Expert Syst Appl"},{"key":"2278_CR30","doi-asserted-by":"crossref","DOI":"10.1142\/5965","volume-title":"The dissimilarity representation for pattern recognition: foundations and applications (machine perception and artificial intelligence)","author":"E Pekalska","year":"2005","unstructured":"Pekalska E, Duin RPW (2005) The dissimilarity representation for pattern recognition: foundations and applications (machine perception and artificial intelligence). World Scientific Publishing Co., Inc, Singapore"},{"issue":"5","key":"2278_CR31","doi-asserted-by":"crossref","first-page":"654","DOI":"10.1016\/j.patrec.2011.07.019","volume":"33","author":"JR Rico-Juan","year":"2012","unstructured":"Rico-Juan JR, I\u00f1esta JM (2012) New rank methods for reducing the size of the training set using the nearest neighbor rule. Pattern Recognit Lett 33(5):654\u2013660","journal-title":"Pattern Recognit Lett"},{"issue":"7","key":"2278_CR32","doi-asserted-by":"crossref","first-page":"1561","DOI":"10.1016\/j.patcog.2003.12.012","volume":"37","author":"J S\u00e1nchez","year":"2004","unstructured":"S\u00e1nchez J (2004) High training set size reduction by space partitioning and prototype abstraction. Pattern Recognit 37(7):1561\u20131564","journal-title":"Pattern Recognit"},{"key":"2278_CR33","doi-asserted-by":"crossref","unstructured":"Serrano A, Mic\u00f3 L, Oncina J (2013) Which fast nearest neighbour search algorithm to use? In: Sanches JM, Mic\u00f3 L, Cardoso JS (eds) 6th Iberian conference on pattern recognition and image analysis (IbPRIA). Funchal, Madeira, Portugal","DOI":"10.1007\/978-3-642-38628-2_67"},{"issue":"1","key":"2278_CR34","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1109\/TSMCC.2010.2103939","volume":"42","author":"I Triguero","year":"2012","unstructured":"Triguero I, Derrac J, Garc\u00eda S, Herrera F (2012) A taxonomy and experimental study on prototype generation for nearest neighbor classification. IEEE Trans Syst Man Cybern C 42(1):86\u2013100","journal-title":"IEEE Trans Syst Man Cybern C"},{"key":"2278_CR35","doi-asserted-by":"crossref","first-page":"240","DOI":"10.1016\/j.knosys.2012.11.005","volume":"39","author":"CF Tsai","year":"2013","unstructured":"Tsai CF, Eberle W, Chu CY (2013) Genetic algorithms in feature and instance selection. Knowl Based Syst 39:240\u2013247","journal-title":"Knowl Based Syst"},{"issue":"1","key":"2278_CR36","doi-asserted-by":"crossref","first-page":"168","DOI":"10.1145\/321796.321811","volume":"21","author":"RA Wagner","year":"1974","unstructured":"Wagner RA, Fischer MJ (1974) The string-to-string correction problem. J ACM 21(1):168\u2013173","journal-title":"J ACM"},{"issue":"3","key":"2278_CR37","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(3):408\u2013421","journal-title":"IEEE Trans Syst Man Cybern"}],"container-title":["Neural Computing and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00521-016-2278-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-016-2278-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-016-2278-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-016-2278-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,17]],"date-time":"2023-08-17T10:48:23Z","timestamp":1692269303000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00521-016-2278-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,3,26]]},"references-count":37,"journal-issue":{"issue":"9","published-print":{"date-parts":[[2017,9]]}},"alternative-id":["2278"],"URL":"https:\/\/doi.org\/10.1007\/s00521-016-2278-8","relation":{},"ISSN":["0941-0643","1433-3058"],"issn-type":[{"type":"print","value":"0941-0643"},{"type":"electronic","value":"1433-3058"}],"subject":[],"published":{"date-parts":[[2016,3,26]]}}}