{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,11,19]],"date-time":"2024-11-19T16:24:19Z","timestamp":1732033459315},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2010,9,3]],"date-time":"2010-09-03T00:00:00Z","timestamp":1283472000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Pattern Anal Applic"],"published-print":{"date-parts":[[2010,11]]},"DOI":"10.1007\/s10044-010-0182-x","type":"journal-article","created":{"date-parts":[[2010,9,2]],"date-time":"2010-09-02T14:19:10Z","timestamp":1283437150000},"page":"367-381","source":"Crossref","is-referenced-by-count":9,"title":["Data pre-processing through reward\u2013punishment editing"],"prefix":"10.1007","volume":"13","author":[{"given":"Annalisa","family":"Franco","sequence":"first","affiliation":[]},{"given":"Davide","family":"Maltoni","sequence":"additional","affiliation":[]},{"given":"Loris","family":"Nanni","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2010,9,3]]},"reference":[{"key":"182_CR1","doi-asserted-by":"crossref","unstructured":"Barandela R, Gasca E (2000) Decontamination of training samples for supervised pattern recognition methods. In: Proceedings of joint IAPR international workshops SSPR and SPR 2000, pp 621\u2013630","DOI":"10.1007\/3-540-44522-6_64"},{"key":"182_CR2","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-0450-1","volume-title":"Pattern recognition with fuzzy objective function algorithms","author":"JC Bezdek","year":"1981","unstructured":"Bezdek JC (1981) Pattern recognition with fuzzy objective function algorithms. Plenum Press, New York"},{"key":"182_CR3","unstructured":"Blake CL, Merz CJ (1998) UCI Repository of machine learning databases. Department of Information and Computer Science, University of California, Irvine. http:\/\/www.ics.uci.edu\/~mlearn\/MLRepository.html"},{"key":"182_CR4","volume-title":"A fast algorithm for the all k nearest neighbors problem in general metric spaces","author":"E Ch\u00e1ves","year":"2001","unstructured":"Ch\u00e1ves E, Figueroa K, Navarro G (2001) A fast algorithm for the all k nearest neighbors problem in general metric spaces. Escuela da Ciencias Fisicas y Matematicas, Universidad Michacana, Morelia"},{"key":"182_CR5","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1109\/TIT.1967.1053964","volume":"13","author":"TM Cover","year":"1967","unstructured":"Cover TM, Hart PE (1967) Nearest neighbor pattern classification. IEEE Trans Inf Theory 13:21\u201327","journal-title":"IEEE Trans Inf Theory"},{"key":"182_CR6","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1007\/s100440050003","volume":"3","author":"BV Dasarathy","year":"2000","unstructured":"Dasarathy BV, Sanchez JS, Townsend S (2000) Nearest neighbour editing and condensing tools\u2014synergy exploitation. Pattern Anal Appl 3:19\u201330","journal-title":"Pattern Anal Appl"},{"key":"182_CR7","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":"182_CR8","unstructured":"Duda RO, Hart PE, Stork DG (2000) Pattern classification, 2nd edn. Wiley, New York"},{"key":"182_CR9","doi-asserted-by":"crossref","unstructured":"Eick CF, Zeidat N, Vilalta R (2004) Using representative-based clustering for nearest neighbor dataset editing. In: Proceedings of IEEE international conference on data mining, pp 375\u2013378","DOI":"10.1109\/ICDM.2004.10044"},{"key":"182_CR10","doi-asserted-by":"crossref","unstructured":"Franco A, Maltoni D, Nanni L (2004) Reward-punishment editing. In: Proceedings of 17th international conference on pattern recognition, vol 4, pp 424\u2013427","DOI":"10.1109\/ICPR.2004.1333793"},{"issue":"2","key":"182_CR11","doi-asserted-by":"crossref","first-page":"170","DOI":"10.1145\/280277.280279","volume":"30","author":"V Gaede","year":"1998","unstructured":"Gaede V, Gunther O (1998) Multidimensional access methods. ACM Comput Surv 30(2):170\u2013231","journal-title":"ACM Comput Surv"},{"key":"182_CR12","unstructured":"Garc\u00eda V, Mollineda RA, S\u00e1nchez JS (2010) On the k-NN performance in a challenging scenario of imbalance and overlapping. Pattern Anal Appl (in press)"},{"key":"182_CR13","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"},{"issue":"8","key":"182_CR14","doi-asserted-by":"crossref","first-page":"832","DOI":"10.1109\/34.709601","volume":"20","author":"TK Ho","year":"1998","unstructured":"Ho TK (1998) The random subspace method for constructing decision forests. IEEE Trans Pattern Anal Mach Intell 20(8):832\u2013844","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"key":"182_CR15","doi-asserted-by":"crossref","unstructured":"Kohonen T (2001) Self-organizing maps, 3rd edn. Springer, Berlin","DOI":"10.1007\/978-3-642-56927-2"},{"key":"182_CR16","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1016\/0031-3203(81)90102-3","volume":"13","author":"J Koplowitz","year":"1981","unstructured":"Koplowitz J, Brown TA (1981) On the relation of performance to editing in nearest neighbor rules. Pattern Recogn 13:251\u2013255","journal-title":"Pattern Recogn"},{"key":"182_CR17","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 Recogn Lett 16:809\u2013814","journal-title":"Pattern Recogn Lett"},{"key":"182_CR18","unstructured":"Li Y, Huang J, Zhang W, Zhang X (2005) New prototype selection rule integrated condensing with editing process for the nearest neighbor rules. In: Proceedings of IEEE international conference on industrial technology, pp 950\u2013954"},{"key":"182_CR19","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 Recogn 35:2771\u20132782","journal-title":"Pattern Recogn"},{"key":"182_CR20","doi-asserted-by":"crossref","first-page":"180","DOI":"10.1016\/j.patcog.2005.06.001","volume":"39","author":"R Paredes","year":"2006","unstructured":"Paredes R, Vidal E (2006) Learning prototypes and distances: a prototype reduction technique based on nearest neighbor error minimization. Pattern Recogn 39:180\u2013188","journal-title":"Pattern Recogn"},{"key":"182_CR21","doi-asserted-by":"crossref","unstructured":"Paredes R, Vidal E (2000) Weighting prototypes, a new editing approach. In: Proceedings of international conference on pattern recognition, vol II, pp 25\u201328","DOI":"10.1109\/ICPR.2000.906011"},{"issue":"1","key":"182_CR22","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1109\/TPAMI.2006.14","volume":"18","author":"C Pedreira","year":"2006","unstructured":"Pedreira C (2006) Learning vector quantization with training data selection. IEEE Trans Pattern Anal Mach Intell 18(1):157\u2013162","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"issue":"9","key":"182_CR23","doi-asserted-by":"crossref","first-page":"2230","DOI":"10.1093\/nar\/26.9.2230","volume":"26","author":"A Reinhardt","year":"1998","unstructured":"Reinhardt A, Hubbard T (1998) Using neural networks for prediction of the subcellular location of proteins. Nucleic Acids Res 26(9):2230\u20132236","journal-title":"Nucleic Acids Res"},{"key":"182_CR24","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-Ruiz JS, Toro M (2003) Finding representative patterns with ordered projections. Pattern Recogn 36:1009\u20131018","journal-title":"Pattern Recogn"},{"issue":"11","key":"182_CR25","doi-asserted-by":"crossref","first-page":"1702","DOI":"10.1093\/bioinformatics\/bth144","volume":"20","author":"T R\u00f6gnvaldsson","year":"2004","unstructured":"R\u00f6gnvaldsson T, You L (2004) Why neural networks should not be used for HIV-1 protease cleavage site prediction. Bioinformatics 20(11):1702\u20131709","journal-title":"Bioinformatics"},{"issue":"11\u201313","key":"182_CR26","first-page":"1179","volume":"18","author":"JS S\u00e1nchez","year":"1998","unstructured":"S\u00e1nchez JS, Pla F, Ferri FJ (1998) On the use of neighborhood-based non-parametric classifiers. Pattern Recogn Lett 18(11\u201313):1179\u20131186","journal-title":"Pattern Recogn Lett"},{"key":"182_CR27","doi-asserted-by":"crossref","first-page":"1015","DOI":"10.1016\/S0167-8655(02)00225-8","volume":"24","author":"JS Sanchez","year":"2003","unstructured":"Sanchez JS, Barandela R, Marquez AI, Alejo R, Badenas J (2003) Analysis of new techniques to obtain quality training sets. Pattern Recogn Lett 24:1015\u20131022","journal-title":"Pattern Recogn Lett"},{"key":"182_CR28","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1007\/s10044-007-0061-2","volume":"10","author":"JS Sanchez","year":"2007","unstructured":"Sanchez JS, Mollineda RA, Sotoca JM (2007) An analysis of how training data complexity affects the nearest neighbor classifiers. Pattern Anal Appl 10:189\u2013201","journal-title":"Pattern Anal Appl"},{"key":"182_CR29","doi-asserted-by":"crossref","unstructured":"Shakhnarovich G, Darrell T, Indyk P (2006) Nearest-neighbor methods in learning and vision: theory and practice. MIT Press, Cambridge","DOI":"10.7551\/mitpress\/4908.001.0001"},{"issue":"2","key":"182_CR30","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1109\/TSMC.1976.5409182","volume":"6","author":"I Tomek","year":"1976","unstructured":"Tomek I (1976) An experiment with the edited nearest neighbor. IEEE Trans Syst Man Cybern 6(2):121\u2013126","journal-title":"IEEE Trans Syst Man Cybern"},{"key":"182_CR31","unstructured":"Vapnik V (1998) Statistical learning theory. Wiley, New York"},{"key":"182_CR32","doi-asserted-by":"crossref","unstructured":"Vazquez F, Sanchez JS, Pla F (2005) A stochastic approach to Wilson\u2019s editing algorithm. In: Proceedings of Iberian conference on pattern recognition and image analysis, pp 35\u201342","DOI":"10.1007\/11492542_5"},{"key":"182_CR33","unstructured":"Watson CI, Wilson CL (1992) NIST Special Database 4, Fingerprint database. U.S. National Institute of Standards and Technology"},{"key":"182_CR34","doi-asserted-by":"crossref","unstructured":"Wilson DL (1972) Asymptotic properties of nearest neighbor rules using edited data. IEEE Trans Syst Man Cybern 2:408\u2013421","DOI":"10.1109\/TSMC.1972.4309137"},{"key":"182_CR35","doi-asserted-by":"crossref","first-page":"2195","DOI":"10.1016\/j.patrec.2005.03.029","volume":"26","author":"XC Yin","year":"2005","unstructured":"Yin XC, Liu CP, Han Z (2005) Feature combination using boosting. Pattern Recogn Lett 26:2195\u20132205","journal-title":"Pattern Recogn Lett"}],"container-title":["Pattern Analysis and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10044-010-0182-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10044-010-0182-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10044-010-0182-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,3]],"date-time":"2019-06-03T04:34:39Z","timestamp":1559536479000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10044-010-0182-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,9,3]]},"references-count":35,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2010,11]]}},"alternative-id":["182"],"URL":"https:\/\/doi.org\/10.1007\/s10044-010-0182-x","relation":{},"ISSN":["1433-7541","1433-755X"],"issn-type":[{"value":"1433-7541","type":"print"},{"value":"1433-755X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,9,3]]}}}