{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,17]],"date-time":"2025-04-17T16:10:18Z","timestamp":1744906218671},"reference-count":63,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2014,2,24]],"date-time":"2014-02-24T00:00:00Z","timestamp":1393200000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Mach. Learn. & Cyber."],"published-print":{"date-parts":[[2016,2]]},"DOI":"10.1007\/s13042-014-0239-z","type":"journal-article","created":{"date-parts":[[2014,2,23]],"date-time":"2014-02-23T09:50:41Z","timestamp":1393149041000},"page":"25-45","source":"Crossref","is-referenced-by-count":12,"title":["Large symmetric margin instance selection algorithm"],"prefix":"10.1007","volume":"7","author":[{"given":"Javad","family":"Hamidzadeh","sequence":"first","affiliation":[]},{"given":"Reza","family":"Monsefi","sequence":"additional","affiliation":[]},{"given":"Hadi","family":"Sadoghi Yazdi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,2,24]]},"reference":[{"issue":"2","key":"239_CR1","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1007\/s10044-008-0142-x","volume":"13","author":"JA Olvera-L\u00f3pez","year":"2010","unstructured":"Olvera-L\u00f3pez JA, Carrasco-Ochoa JA, Mart\u00ednez-Trinidad JF (2010) A new fast prototype selection method based on clustering. Pattern Anal Appl 13(2):131\u2013141","journal-title":"Pattern Anal Appl"},{"issue":"1","key":"239_CR2","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1007\/s10115-010-0375-z","volume":"30","author":"I Czarnowski","year":"2012","unstructured":"Czarnowski I (2012) Cluster-based instance selection for machine classification. Knowl Inf Syst 30(1):113\u2013133","journal-title":"Knowl Inf Syst"},{"key":"239_CR3","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1016\/j.patcog.2009.05.012","volume":"43","author":"H Cheng","year":"2010","unstructured":"Cheng H, Shan J, Ju W, Guo Y, Zhang L (2010) Automated breast cancer detection and classification using ultrasound images: a survey. Pattern Recogn 43:299\u2013317","journal-title":"Pattern Recogn"},{"key":"239_CR4","doi-asserted-by":"crossref","first-page":"439","DOI":"10.1007\/s10618-009-0158-x","volume":"20","author":"S Rosset","year":"2010","unstructured":"Rosset S, Perlich C, Swirszcz G, Melville P, Liu Y (2010) Medical data mining: insights from winning two competitions. Data Min Knowl Disc 20:439\u2013468","journal-title":"Data Min Knowl Disc"},{"key":"239_CR5","doi-asserted-by":"crossref","first-page":"2763","DOI":"10.1016\/j.patcog.2010.02.008","volume":"43","author":"H Liu","year":"2010","unstructured":"Liu H, Liu L, Zhang H (2010) Ensemble gene selection for cancer classification. Pattern Recogn 43:2763\u20132772","journal-title":"Pattern Recogn"},{"key":"239_CR6","doi-asserted-by":"crossref","first-page":"2061","DOI":"10.1016\/j.patrec.2010.05.006","volume":"31","author":"B Twala","year":"2010","unstructured":"Twala B, Phorah M (2010) Predicting incomplete gene microarray data with the use of supervised learning algorithms. Pattern Recogn Lett 31:2061\u20132069","journal-title":"Pattern Recogn Lett"},{"key":"239_CR7","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1007\/s13042-012-0091-y","volume":"4","author":"A Dhurandhar","year":"2013","unstructured":"Dhurandhar A, Dobra A (2013) Probabilistic characterization of nearest neighbor classifier. Int J Mach Learn Cybernet 4:259\u2013272","journal-title":"Int J Mach Learn Cybernet"},{"key":"239_CR8","author":"T Basu","year":"2013","unstructured":"Basu T, Murthy CA (2013) Towards enriching the quality of k-nearest neighbor rule for document classification. Int J Mach Learn Cybernet. doi: 10.1007\/s13042-013-0177-1","journal-title":"Int J Mach Learn Cybernet"},{"key":"239_CR9","author":"N Toma\u0161ev","year":"2012","unstructured":"Toma\u0161ev N, Radovanovi\u0107 M, Mladeni\u0107 D, Ivanovi\u0107 M (2012) Hubness-based fuzzy measures for high-dimensional k-nearest neighbor classification. Int J Mach Learn Cybernet. doi: 10.1007\/s13042-012-0137-1","journal-title":"Int J Mach Learn Cybernet"},{"key":"239_CR10","doi-asserted-by":"crossref","first-page":"1697","DOI":"10.1007\/s00521-011-0762-8","volume":"21","author":"J Hamidzadeh","year":"2012","unstructured":"Hamidzadeh J, Monsefi R, Sadoghi Yazdi H (2012) DDC: distance-based decision classifier. Neural Comput Appl 21:1697\u20131707","journal-title":"Neural Comput Appl"},{"key":"239_CR11","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/s13042-010-0003-y","volume":"1","author":"K Small","year":"2010","unstructured":"Small K, Roth D (2010) Margin-based active learning for structured predictions. Int J Mach Learn Cybernet 1:3\u201325","journal-title":"Int J Mach Learn Cybernet"},{"issue":"8","key":"239_CR12","doi-asserted-by":"crossref","first-page":"1491","DOI":"10.1109\/TKDE.2011.67","volume":"24","author":"XZ Wang","year":"2012","unstructured":"Wang XZ, Dong LC, Yan JH (2012) Maximum ambiguity based sample selection in fuzzy decision tree induction. IEEE Trans Knowl Data Eng 24(8):1491\u20131505","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"239_CR13","doi-asserted-by":"crossref","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":"239_CR14","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"},{"issue":"8","key":"239_CR15","doi-asserted-by":"crossref","first-page":"1075","DOI":"10.1109\/TPAMI.2002.1023804","volume":"24","author":"W Lam","year":"2002","unstructured":"Lam W, Keung CK, Liu D (2002) Discovering useful concept prototypes for classification based on filtering and abstraction. IEEE Trans Pattern Anal Mach Intell 24(8):1075\u20131090","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"issue":"9","key":"239_CR16","doi-asserted-by":"crossref","first-page":"1417","DOI":"10.1109\/TPAMI.2005.187","volume":"27","author":"CJ Veenman","year":"2005","unstructured":"Veenman CJ, Reinders MJT (2005) The nearest subclass classifier: a compromise between the nearest mean and nearest neighbor classifier. IEEE Trans Pattern Mach Intell 27(9):1417\u20131429","journal-title":"IEEE Trans Pattern Mach Intell"},{"issue":"3","key":"239_CR17","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1109\/TPAMI.2011.142","volume":"34","author":"S Garc\u00eda","year":"2012","unstructured":"Garc\u00eda S, Derrac J, Cano JR, Herrera F (2012) Prototype selection for nearest neighbor classification: taxonomy and empirical study. IEEE Trans Pattern Mach Intell 34(3):417\u2013435","journal-title":"IEEE Trans Pattern Mach Intell"},{"key":"239_CR18","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1007\/s10462-010-9165-y","volume":"34","author":"AJ Olvera-Lopez","year":"2010","unstructured":"Olvera-Lopez AJ, Carrasco-Ochoa JF, Martinez-Trinidad JA, Kittler J (2010) A review of instance selection methods. Artif Intell Rev 34:133\u2013143","journal-title":"Artif Intell Rev"},{"issue":"4","key":"239_CR19","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1007\/s10044-007-0065-y","volume":"10","author":"JR Herrero","year":"2007","unstructured":"Herrero JR, Navarro JJ (2007) Exploiting computer resources for fast nearest neighbor classification. Pattern Anal Appl 10(4):265\u2013275","journal-title":"Pattern Anal Appl"},{"key":"239_CR20","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. IEEE Trans Inf Theory 14:515\u2013516","journal-title":"IEEE Trans Inf Theory"},{"issue":"3","key":"239_CR21","doi-asserted-by":"crossref","first-page":"431","DOI":"10.1109\/TIT.1972.1054809","volume":"18","author":"GW Gates","year":"1972","unstructured":"Gates GW (1972) The reduced nearest neighbor rule. IEEE Trans Inf Theory 18(3):431\u2013433","journal-title":"IEEE Trans Inf Theory"},{"key":"239_CR22","doi-asserted-by":"crossref","first-page":"408","DOI":"10.1109\/TSMC.1972.4309137","volume":"2","author":"D Wilson","year":"1972","unstructured":"Wilson D (1972) Asymptotic properties of nearest neighbor rules using edited data. IEEE Trans Syst Man Cybernet 2:408\u2013421","journal-title":"IEEE Trans Syst Man Cybernet"},{"issue":"6","key":"239_CR23","doi-asserted-by":"crossref","first-page":"448","DOI":"10.1109\/TSMC.1976.4309523","volume":"6","author":"I Tomek","year":"1976","unstructured":"Tomek I (1976) An experiment with the edited nearest-neighbor rule. IEEE Trans Syst Man Cybernet 6(6):448\u2013452","journal-title":"IEEE Trans Syst Man Cybernet"},{"issue":"1","key":"239_CR24","doi-asserted-by":"crossref","first-page":"72","DOI":"10.1162\/neco.1995.7.1.72","volume":"7","author":"DG Lowe","year":"1995","unstructured":"Lowe DG (1995) Similarity metric learning for a variable-kernel classifier. Neural Comput 7(1):72\u201385","journal-title":"Neural Comput"},{"issue":"2","key":"239_CR25","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 Disc 6(2):153\u2013172","journal-title":"Data Min Knowl Disc"},{"key":"239_CR26","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 Recogn 39:495\u2013497","journal-title":"Pattern Recogn"},{"issue":"10","key":"239_CR27","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 Recogn Lett 26(10):1554\u20131567","journal-title":"Pattern Recogn Lett"},{"issue":"5","key":"239_CR28","doi-asserted-by":"crossref","first-page":"890","DOI":"10.1109\/TNN.2009.2018547","volume":"20","author":"HA Fayed","year":"2009","unstructured":"Fayed HA, Atiya AF (2009) A novel template, reduction approach for the K-nearest neighbor method. IEEE Trans Neural Netw 20(5):890\u2013896","journal-title":"IEEE Trans Neural Netw"},{"key":"239_CR29","first-page":"997","volume":"9","author":"E Marchiori","year":"2008","unstructured":"Marchiori E (2008) Hit miss networks with applications to instance selection. J Mach Learn Res 9:997\u20131017","journal-title":"J Mach Learn Res"},{"issue":"2","key":"239_CR30","doi-asserted-by":"crossref","first-page":"364","DOI":"10.1109\/TPAMI.2009.164","volume":"32","author":"E Marchiori","year":"2010","unstructured":"Marchiori E (2010) Class conditional nearest neighbor for large margin instance selection. IEEE Trans Pattern Anal Mach Intell 32(2):364\u2013370","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"key":"239_CR31","doi-asserted-by":"crossref","first-page":"704","DOI":"10.1016\/j.patcog.2010.08.014","volume":"44","author":"K Nikolaidis","year":"2011","unstructured":"Nikolaidis K, Goulermasn JY, Wu QH (2011) A class boundary preserving algorithm for data condensation. Pattern Recogn 44:704\u2013715","journal-title":"Pattern Recogn"},{"key":"239_CR32","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1016\/j.patrec.2009.09.022","volume":"31","author":"CG Vallejo","year":"2010","unstructured":"Vallejo CG, Troyano JA, Ortega FJ (2010) InstanceRank: bringing order to datasets. Pattern Recogn Lett 31:133\u2013142","journal-title":"Pattern Recogn Lett"},{"key":"239_CR33","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1016\/j.patcog.2012.07.007","volume":"46","author":"P Hernandez-Leal","year":"2013","unstructured":"Hernandez-Leal P, Carrasco-Ochoaa JA, Martinez-Trinidada JF, Olvera-Lopez JA (2013) InstanceRank based on borders for instance selection. Pattern Recogn 46:365\u2013375","journal-title":"Pattern Recogn"},{"key":"239_CR34","doi-asserted-by":"crossref","first-page":"809","DOI":"10.1016\/0167-8655(95)00047-K","volume":"16","author":"L Kuncheva","year":"1995","unstructured":"Kuncheva L (1995) Editing for the k-nearest neighbors rule by a genetic algorithm. Pattern Recogn Lett 16:809\u2013814","journal-title":"Pattern Recogn Lett"},{"key":"239_CR35","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 Recogn 30:1041\u20131049","journal-title":"Pattern Recogn"},{"issue":"6","key":"239_CR36","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"},{"key":"239_CR37","doi-asserted-by":"crossref","first-page":"2693","DOI":"10.1016\/j.patcog.2008.02.006","volume":"41","author":"S Garcia","year":"2008","unstructured":"Garcia S, Cano JR, Herera F (2008) A Memetic algorithm for evolutionary prototype selection: a scaling up approach. Pattern Recogn 41:2693\u20132709","journal-title":"Pattern Recogn"},{"key":"239_CR38","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":"239_CR39","doi-asserted-by":"crossref","unstructured":"Reeves CR, Bush DR (2001) Using genetic algorithms for training data selection in RBF networks. In: Instance selection and construction for data mining. Kluwer Academic Publishers, pp 339\u2013356","DOI":"10.1007\/978-1-4757-3359-4_19"},{"issue":"2","key":"239_CR40","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1109\/TNN.2009.2039227","volume":"21","author":"F Angiulli","year":"2010","unstructured":"Angiulli F, Astorino A (2010) Scaling up support vector machines using nearest neighbor condensation. IEEE Trans Neural Netw 21(2):351\u2013357","journal-title":"IEEE Trans Neural Netw"},{"issue":"6","key":"239_CR41","doi-asserted-by":"crossref","first-page":"1189","DOI":"10.1109\/TPAMI.2010.188","volume":"33","author":"Y Li","year":"2011","unstructured":"Li Y, Maguire L (2011) Selecting critical patterns based on local geometrical and statistical information. IEEE Trans Pattern Anal Mach Intell 33(6):1189\u20131201","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"key":"239_CR42","first-page":"6","volume":"41","author":"KA Smith-Miles","year":"2008","unstructured":"Smith-Miles KA (2008) Cross-disciplinary perspectives on meta-learning for algorithm selection. ACM Comput Surv 41:6\u201325","journal-title":"ACM Comput Surv"},{"key":"239_CR43","doi-asserted-by":"crossref","unstructured":"Smith-Miles K, Islam R (2010) Meta-learning for data summarization based on instance selection method. In: 2010 IEEE congress on evolutionary computation (CEC). Barcelona, Spain, pp 1\u20138","DOI":"10.1109\/CEC.2010.5585986"},{"issue":"20","key":"239_CR44","doi-asserted-by":"crossref","first-page":"4780","DOI":"10.1016\/j.ins.2011.06.013","volume":"181","author":"Y Caises","year":"2011","unstructured":"Caises Y, Gonz\u00e1lez A, Leyva E, P\u00e9rez R (2011) Combining instance selection methods based on data characterization: an approach to increase their effectiveness. Inf Sci 181(20):4780\u20134798","journal-title":"Inf Sci"},{"key":"239_CR45","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1016\/j.knosys.2013.04.005","volume":"47","author":"E Leyva","year":"2013","unstructured":"Leyva E, Gonz\u00e1lez A, P\u00e9rez R (2013) Knowledge-based instance selection: a compromise between efficiency and versatility. Knowl Based Syst 47:65\u201376","journal-title":"Knowl Based Syst"},{"key":"239_CR46","doi-asserted-by":"crossref","first-page":"495","DOI":"10.1007\/s10898-007-9152-2","volume":"39","author":"ZY Wu","year":"2007","unstructured":"Wu ZY, Bai FS, Lee HWJ, Yang YJ (2007) A filled function method for constrained global optimization. J Glob Optim 39:495\u2013507","journal-title":"J Glob Optim"},{"key":"239_CR47","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1007\/BF01585737","volume":"46","author":"RP Ge","year":"1990","unstructured":"Ge RP (1990) A filled function method for finding a global minimizer of a function of several variables. Math Progr 46:191\u2013204","journal-title":"Math Progr"},{"key":"239_CR48","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1016\/j.ejor.2007.05.028","volume":"189","author":"YL Shang","year":"2008","unstructured":"Shang YL, Zhang LS (2008) Finding discrete global minima with a filled function for integer programming. Eur J Oper Res 189:31\u201340","journal-title":"Eur J Oper Res"},{"key":"239_CR49","doi-asserted-by":"crossref","first-page":"3114","DOI":"10.1016\/j.apm.2008.10.015","volume":"33","author":"Y Zhang","year":"2009","unstructured":"Zhang Y, Zhang L, Xu Y (2009) New filled functions for nonsmooth global optimization. Appl Math Model 33:3114\u20133129","journal-title":"Appl Math Model"},{"key":"239_CR50","doi-asserted-by":"crossref","first-page":"519","DOI":"10.1016\/j.ejor.2008.07.026","volume":"197","author":"AF Ling","year":"2009","unstructured":"Ling AF, Xu CX, Xu F-M (2009) A discrete filled function algorithm embedded with continuous approximation for solving max-cut problems. Eur J Oper Res 197:519\u2013531","journal-title":"Eur J Oper Res"},{"key":"239_CR51","doi-asserted-by":"crossref","first-page":"415","DOI":"10.1016\/j.cam.2009.06.020","volume":"232","author":"Y Zhang","year":"2009","unstructured":"Zhang Y, Xu Y, Zhang L (2009) A filled function method applied to nonsmooth constrained global optimization. J Comput Appl Math 232:415\u2013426","journal-title":"J Comput Appl Math"},{"key":"239_CR52","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1016\/j.cam.2008.07.001","volume":"225","author":"C Wang","year":"2009","unstructured":"Wang C, Yang Y, Li J (2009) A new filled function method for unconstrained global optimization. J Comput Appl Math 225:68\u201379","journal-title":"J Comput Appl Math"},{"key":"239_CR53","doi-asserted-by":"crossref","first-page":"3610","DOI":"10.1016\/j.amc.2009.10.057","volume":"215","author":"S Ma","year":"2010","unstructured":"Ma S, Yang Y, Liu H (2010) A parameter free filled function for unconstrained global optimization. Appl Math Comput 215:3610\u20133619","journal-title":"Appl Math Comput"},{"key":"239_CR54","doi-asserted-by":"crossref","unstructured":"Jie L (2011) A new filled function algorithm for constrained global optimization problems. In: Seventh International conference on computational intelligence and security, pp 38\u201341","DOI":"10.1109\/CIS.2011.17"},{"key":"239_CR55","doi-asserted-by":"crossref","unstructured":"Shuqing J (2012) A filled function method with one parameter for box constraint. In: Eighth International conference on computational intelligence and security, pp 1\u20134","DOI":"10.1109\/CIS.2012.9"},{"key":"239_CR56","doi-asserted-by":"crossref","first-page":"3100","DOI":"10.1016\/j.amc.2012.09.041","volume":"219","author":"Y Lin","year":"2012","unstructured":"Lin Y, Yang Y (2012) A new filled function method for constrained nonlinear equations. Appl Math Comput 219:3100\u20133112","journal-title":"Appl Math Comput"},{"key":"239_CR57","doi-asserted-by":"crossref","unstructured":"Wang W, Shang Y (2012) A quasi-filled function approach for nonlinear global integer optimization. In: Fifth International joint conference on computational sciences and optimization, pp 359\u2013361","DOI":"10.1109\/CSO.2012.86"},{"key":"239_CR58","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1016\/j.ejor.2008.07.031","volume":"198","author":"T Antczak","year":"2009","unstructured":"Antczak T (2009) Exact penalty functions method for mathematical programming problems involving index functions. Eur J Oper Res 198:29\u201336","journal-title":"Eur J Oper Res"},{"key":"239_CR59","unstructured":"Bache K, Lichman M (2013) UCI machine learning repository. ( http:\/\/archive.ics.uci.edu\/ml ), University of California, School of Information and Computer Science, Irvine"},{"key":"239_CR60","first-page":"1","volume":"7","author":"J Dem\u0161ar","year":"2006","unstructured":"Dem\u0161ar J (2006) Statistical comparisons of classifiers over multiple data sets. J Mach Learn Res 7:1\u201330","journal-title":"J Mach Learn Res"},{"key":"239_CR61","doi-asserted-by":"crossref","first-page":"2044","DOI":"10.1016\/j.ins.2009.12.010","volume":"180","author":"S Garc\u00eda","year":"2010","unstructured":"Garc\u00eda S, Fern\u00e1ndez A, Luengo J, Herrera F (2010) Advanced nonparametric tests for multiple comparisons in the design of experiments in computational intelligence and data mining: experimental analysis of power. Inf Sci 180:2044\u20132064","journal-title":"Inf Sci"},{"key":"239_CR62","doi-asserted-by":"crossref","first-page":"920","DOI":"10.1080\/01621459.1993.10476358","volume":"88","author":"H Finner","year":"1993","unstructured":"Finner H (1993) On a monotonicity problem in step-down multiple test procedures. J Am Stat Assoc 88:920\u2013923","journal-title":"J Am Stat Assoc"},{"issue":"2","key":"239_CR63","doi-asserted-by":"crossref","first-page":"451","DOI":"10.1214\/aos\/1028144844","volume":"26","author":"T Hastie","year":"1998","unstructured":"Hastie T, Tibshirani R (1998) Classification by pairwise coupling. Ann Stat 26(2):451\u2013471","journal-title":"Ann Stat"}],"container-title":["International Journal of Machine Learning and Cybernetics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13042-014-0239-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s13042-014-0239-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13042-014-0239-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,2]],"date-time":"2019-06-02T14:31:14Z","timestamp":1559485874000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s13042-014-0239-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,2,24]]},"references-count":63,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2016,2]]}},"alternative-id":["239"],"URL":"https:\/\/doi.org\/10.1007\/s13042-014-0239-z","relation":{},"ISSN":["1868-8071","1868-808X"],"issn-type":[{"value":"1868-8071","type":"print"},{"value":"1868-808X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,2,24]]}}}