{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,2]],"date-time":"2026-05-02T06:32:08Z","timestamp":1777703528920,"version":"3.51.4"},"reference-count":36,"publisher":"SAGE Publications","issue":"5","license":[{"start":{"date-parts":[[2018,5,17]],"date-time":"2018-05-17T00:00:00Z","timestamp":1526515200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/journals.sagepub.com\/page\/policies\/text-and-data-mining-license"}],"content-domain":{"domain":["journals.sagepub.com"],"crossmark-restriction":true},"short-container-title":["Journal of Intelligent &amp; Fuzzy Systems"],"published-print":{"date-parts":[[2018,5,24]]},"abstract":"<jats:p>In supervised classification, a training set is given to a classifier to learn a decision rule for classifying unseen cases. When large training sets are processed, the training stage becomes slow especially for instance-based learning. However, not all information in a training set is useful for classification because it could contain either redundant or noisy prototypes. Therefore a process for discarding useless prototypes is required; this process is known as prototype selection. In this work, we present some methods for selecting prototypes based on prototype relevance, which are accurate and fast for large datasets; in addition, our methods can be applied over datasets described by nominal features. We report experimental results showing the effectiveness of our methods as well as a comparison against other successful prototype selection methods.<\/jats:p>","DOI":"10.3233\/jifs-169478","type":"journal-article","created":{"date-parts":[[2018,5,18]],"date-time":"2018-05-18T10:37:57Z","timestamp":1526639877000},"page":"2923-2934","update-policy":"https:\/\/doi.org\/10.1177\/sage-journals-update-policy","source":"Crossref","is-referenced-by-count":3,"title":["Accurate and fast prototype selection based on the notion of relevant and border prototypes"],"prefix":"10.1177","volume":"34","author":[{"given":"J. Arturo","family":"Olvera-L\u00f3pez","sequence":"first","affiliation":[{"name":"Facultad de Ciencias de la Computaci\u00f3n, Autonomous University of Puebla, Puebla, Mexico"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J. Ariel","family":"Carrasco-Ochoa","sequence":"additional","affiliation":[{"name":"Coordinaci\u00f3n de Ciencias Computacionales, National Institute of Astrophysics, Optics and Electronics, Puebla, Mexico"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J. Franciso","family":"Mart\u00ednez-Trinidad","sequence":"additional","affiliation":[{"name":"Coordinaci\u00f3n de Ciencias Computacionales, National Institute of Astrophysics, Optics and Electronics, Puebla, Mexico"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"179","published-online":{"date-parts":[[2018,5,17]]},"reference":[{"key":"e_1_3_1_2_2","doi-asserted-by":"publisher","DOI":"10.1109\/5326.661099"},{"key":"e_1_3_1_3_2","doi-asserted-by":"crossref","unstructured":"Olvera-L\u00f3pezJ.A. Carrasco-OchoaJ.A. Mart\u00ednez-TrinidadJ.F.Prototype Selection Via Prototype RelevanceRuiz-ShulcloerJ. and KropatschW.G.CIARP LNCS153\u2013160.","DOI":"10.1007\/978-3-540-85920-8_19"},{"key":"e_1_3_1_4_2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1967.1053964"},{"key":"e_1_3_1_5_2","doi-asserted-by":"publisher","DOI":"10.1023\/A:1006559212014"},{"key":"e_1_3_1_6_2","unstructured":"VapnikV. The Nature of Statistical Learning Theory Springer-VerlagNew York1995."},{"key":"e_1_3_1_7_2","doi-asserted-by":"publisher","DOI":"10.1016\/B978-0-08-050058-4.50007-3"},{"key":"e_1_3_1_8_2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1968.1054155"},{"key":"e_1_3_1_9_2","first-page":"556","article-title":"The Generalized Condensed Nearest Neighbor Rule as A Data Reduction Method","volume":"2","author":"Chien-Hsing C.","year":"2006","unstructured":"Chien-HsingC., Bo-HanK. and FuC., The Generalized Condensed Nearest Neighbor Rule as A Data Reduction Method, in: 18th International Conference on Pattern Recognition (2006),2, 556\u2013559.","journal-title":"in: 18th International Conference on Pattern Recognition"},{"key":"e_1_3_1_10_2","doi-asserted-by":"publisher","DOI":"10.1109\/TSMC.1972.4309137"},{"key":"e_1_3_1_11_2","unstructured":"DevijverP.A. and KittlerJ. On the edited nearest neighbor rule In Proceedings of the 5th International Conference on Pattern Recognition (1980) 72\u201380."},{"key":"e_1_3_1_12_2","doi-asserted-by":"publisher","DOI":"10.1023\/A:1007626913721"},{"key":"e_1_3_1_13_2","doi-asserted-by":"publisher","DOI":"10.1023\/A:1014043630878"},{"key":"e_1_3_1_14_2","first-page":"528","volume-title":"ICNIC 2005, LNCS 3610","author":"Yuangui L.","year":"2005","unstructured":"YuanguiL., ZhonhuiH., YunzeC., WeidongZ., Support Vector Based Prototype Selection Method for Nearest Neighbor Rules, WangL., ICNIC 2005, LNCS 3610 (2005), 528\u2013535."},{"key":"e_1_3_1_15_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10044-008-0106-1"},{"key":"e_1_3_1_16_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2008.02.006"},{"key":"e_1_3_1_17_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10994-009-5161-3"},{"key":"e_1_3_1_18_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.patrec.2009.09.022"},{"key":"e_1_3_1_19_2","doi-asserted-by":"publisher","DOI":"10.1002\/int.1068"},{"key":"e_1_3_1_20_2","doi-asserted-by":"publisher","DOI":"10.1023\/A:1014056429969"},{"key":"e_1_3_1_21_2","doi-asserted-by":"publisher","DOI":"10.1007\/11815921_31"},{"key":"e_1_3_1_22_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-04394-9_3"},{"key":"e_1_3_1_23_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2005.11.004"},{"key":"e_1_3_1_24_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10044-008-0142-x"},{"key":"e_1_3_1_25_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2014.10.001"},{"key":"e_1_3_1_26_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2014.11.005"},{"key":"e_1_3_1_27_2","first-page":"168","article-title":"Fast and accurate k-nearest neighbor classification using prototype selection by clustering","author":"Ougiaroglou S.","year":"2012","unstructured":"OugiaroglouS. and EvangelidisG., Fast and accurate k-nearest neighbor classification using prototype selection by clustering, In: 16th IEEE Panhellenic Conference on Informatics (2012), pp 168\u2013173.","journal-title":"In: 16th IEEE Panhellenic Conference on Informatics"},{"key":"e_1_3_1_28_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2012.07.007"},{"key":"e_1_3_1_29_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10618-008-0121-2"},{"key":"e_1_3_1_30_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.datak.2012.03.002"},{"key":"e_1_3_1_31_2","doi-asserted-by":"publisher","DOI":"10.1016\/B978-0-12-737140-5.50029-4"},{"key":"e_1_3_1_32_2","unstructured":"BacheK. and LichmanM. UCI Machine Learning Repository Irvine CAUniversity of California School of Information and Computer Science (2013) http:\/\/archive.ics.uci.edu\/ml."},{"key":"e_1_3_1_33_2","doi-asserted-by":"publisher","DOI":"10.1613\/jair.346"},{"key":"e_1_3_1_34_2","doi-asserted-by":"publisher","DOI":"10.1145\/1656274.1656278"},{"key":"e_1_3_1_35_2","first-page":"1","article-title":"Statistical comparisons of classifiers over multiple data sets","volume":"7","author":"Dem\u0161ar J.","year":"2006","unstructured":"Dem\u0161arJ., Statistical comparisons of classifiers over multiple data sets, Journal of Machine Learning Research7 (2006), 1\u201330.","journal-title":"Journal of Machine Learning Research"},{"key":"e_1_3_1_36_2","doi-asserted-by":"publisher","DOI":"10.3233\/IFS-151792"},{"key":"e_1_3_1_37_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2016.10.031"}],"container-title":["Journal of Intelligent &amp; Fuzzy Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.3233\/JIFS-169478","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/full-xml\/10.3233\/JIFS-169478","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.3233\/JIFS-169478","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T09:38:54Z","timestamp":1777455534000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/10.3233\/JIFS-169478"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,5,17]]},"references-count":36,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2018,5,24]]}},"alternative-id":["10.3233\/JIFS-169478"],"URL":"https:\/\/doi.org\/10.3233\/jifs-169478","relation":{},"ISSN":["1064-1246","1875-8967"],"issn-type":[{"value":"1064-1246","type":"print"},{"value":"1875-8967","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,5,17]]}}}