{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,2]],"date-time":"2026-05-02T04:22:58Z","timestamp":1777695778853,"version":"3.51.4"},"reference-count":35,"publisher":"SAGE Publications","issue":"4","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IDA"],"published-print":{"date-parts":[[2019,9,26]]},"DOI":"10.3233\/ida-184190","type":"journal-article","created":{"date-parts":[[2019,10,1]],"date-time":"2019-10-01T14:02:57Z","timestamp":1569938577000},"page":"855-876","source":"Crossref","is-referenced-by-count":3,"title":["Adaptive geometric median prototype selection method for k-nearest neighbors classification"],"prefix":"10.1177","volume":"23","author":[{"given":"Chatchai","family":"Kasemtaweechok","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Worasait","family":"Suwannik","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"179","reference":[{"key":"10.3233\/IDA-184190_ref1","doi-asserted-by":"crossref","first-page":"875","DOI":"10.1016\/j.engappai.2007.01.001","article-title":"A lot of randomness is hiding in accuracy","volume":"20","author":"Ben-David","year":"2007","journal-title":"Engineering Applications of Artificial Intelligence"},{"key":"10.3233\/IDA-184190_ref2","doi-asserted-by":"crossref","unstructured":"C. Kasemtaweechok and W. Suwannik, Prototype selection for k-nearest neighbors classification using geometric median, in: the Fifth International Conference on Network, Communication and Computing, ACM, Kyoto, 2016, pp. 140\u2013144.","DOI":"10.1145\/3033288.3033301"},{"key":"10.3233\/IDA-184190_ref3","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1007\/s10462-010-9156-z","article-title":"A study of the effect of different types of noise on the precision of supervised learning techniques","volume":"33","author":"Nettleton","year":"2010","journal-title":"Artificial Intelligence Review"},{"key":"10.3233\/IDA-184190_ref4","doi-asserted-by":"crossref","first-page":"408","DOI":"10.1109\/TSMC.1972.4309137","article-title":"Asymptotic properties of nearest neighbor rules using edited data","volume":"SMC-2","author":"Wilson","year":"1972","journal-title":"IEEE Transactions on Systems, Man, and Cybernetics: Systems"},{"key":"10.3233\/IDA-184190_ref5","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1023\/A:1007626913721","article-title":"Reduction techniques for instance-based learning algorithms","volume":"38","author":"Wilson","year":"2000","journal-title":"Machine Learning Journal"},{"key":"10.3233\/IDA-184190_ref6","doi-asserted-by":"crossref","first-page":"148","DOI":"10.1007\/BF01581035","article-title":"Greedy strikes back: Heuristics for the fixed cost median problem","volume":"22","author":"Hochbaum","year":"1982","journal-title":"Mathematical Programming"},{"key":"10.3233\/IDA-184190_ref7","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1007\/BF00153759","article-title":"Instance-based learning algorithms","volume":"6","author":"Aha","year":"1991","journal-title":"Machine Learning Journal"},{"key":"10.3233\/IDA-184190_ref8","first-page":"997","article-title":"Hit miss networks with applications to instance selection","volume":"9","author":"Marchiori","year":"2008","journal-title":"Journal of Machine Learning Research"},{"key":"10.3233\/IDA-184190_ref9","doi-asserted-by":"crossref","first-page":"364","DOI":"10.1109\/TPAMI.2009.164","article-title":"Class conditional nearest neighbor for large margin instance selection","volume":"32","author":"Marchiori","year":"2010","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"key":"10.3233\/IDA-184190_ref10","doi-asserted-by":"crossref","first-page":"1450","DOI":"10.1109\/TKDE.2007.190645","article-title":"Fast nearest neighbor condensation for large data sets classification","volume":"19","author":"Angiulli","year":"2007","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"10.3233\/IDA-184190_ref11","doi-asserted-by":"crossref","first-page":"80","DOI":"10.2307\/3001968","article-title":"Individual comparisons by ranking methods","volume":"1","author":"Wilcoxon","year":"1945","journal-title":"Biometrics Bulletin"},{"key":"10.3233\/IDA-184190_ref12","doi-asserted-by":"crossref","first-page":"431","DOI":"10.1109\/TIT.1972.1054809","article-title":"The reduced nearest neighbor rule","volume":"18","author":"Gates","year":"1972","journal-title":"IEEE Transactions on Information Theory"},{"key":"10.3233\/IDA-184190_ref13","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1023\/A:1014043630878","article-title":"Advances in instance selection for instance-based","volume":"6","author":"Brighton","year":"2002","journal-title":"Data Mining and Knowledge Discovery Journal"},{"key":"10.3233\/IDA-184190_ref14","doi-asserted-by":"crossref","first-page":"448","DOI":"10.1109\/TSMC.1976.4309523","article-title":"An experiment with the edited nearest-neighbor rule","volume":"SMC-6","author":"Tomek","year":"1976","journal-title":"IEEE Transactions on Systems, Man, and Cybernetics: Systems"},{"key":"10.3233\/IDA-184190_ref15","first-page":"255","article-title":"KEEL data-mining software tool: Data set repository, integration of algorithms and experimental analysis framework","volume":"17","author":"Alcala-Fdez","year":"2011","journal-title":"Journal of Multiple-Valued Logic and Soft Computing"},{"key":"10.3233\/IDA-184190_ref16","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1007\/s10462-010-9165-y","article-title":"A review of instance selection methods","volume":"34","author":"Olvera-Lopez","year":"2010","journal-title":"Artificial Intelligence Review"},{"key":"10.3233\/IDA-184190_ref17","doi-asserted-by":"crossref","first-page":"507","DOI":"10.1016\/S0167-8655(97)00035-4","article-title":"Prototype selection for the nearest neighbour rule through proximity graphs","volume":"18","author":"Sanchez","year":"1997","journal-title":"Pattern Recognition Letter"},{"key":"10.3233\/IDA-184190_ref18","doi-asserted-by":"crossref","first-page":"1561","DOI":"10.1016\/j.patcog.2003.12.012","article-title":"High training set size reduction by space partitioning and prototype abstraction","volume":"37","author":"Sanchez","year":"2004","journal-title":"The Journal of the Pattern Recognition Society"},{"key":"10.3233\/IDA-184190_ref19","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1016\/0895-7177(93)90204-C","article-title":"Simulated annealing: Practice versus theory","volume":"18","author":"Ingber","year":"1993","journal-title":"Mathematical and Computer Modelling"},{"key":"10.3233\/IDA-184190_ref20","unstructured":"M. Lichman, UCI Machine Learning Repository, http:\/\/archive.ics.uci.edu\/ml, University of California, 2013."},{"key":"10.3233\/IDA-184190_ref21","doi-asserted-by":"crossref","first-page":"1827","DOI":"10.1016\/j.patcog.2006.04.005","article-title":"Experimental study on prototype optimisation algorithms for prototype-based classification in vector spaces","volume":"39","author":"Lozano","year":"2006","journal-title":"The Journal of the Pattern Recognition Society"},{"key":"10.3233\/IDA-184190_ref22","first-page":"268","article-title":"Properties of Sufficiency and Statistical Tests","author":"Bartlett","year":"1937","journal-title":"The Royal Society of London Series A Mathematical, Physical and Engineering Sciences"},{"key":"10.3233\/IDA-184190_ref23","doi-asserted-by":"crossref","first-page":"194","DOI":"10.1016\/0167-6377(82)90039-6","article-title":"On the complexity of locating linear facilities in the plane","volume":"1","author":"Megiddo","year":"1982","journal-title":"Operations Research Letters"},{"key":"10.3233\/IDA-184190_ref24","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1080\/00031305.1992.10475879","article-title":"An introduction to kernel and nearest neighbor nonparametric regression","volume":"46","author":"Altman","year":"1992","journal-title":"The American Statistician"},{"key":"10.3233\/IDA-184190_ref25","doi-asserted-by":"crossref","first-page":"515","DOI":"10.1109\/TIT.1968.1054155","article-title":"Greedy Strikes Back: The Condensed Nearest Neighbor Rule","volume":"14","author":"Hart","year":"1968","journal-title":"IEEE Transactions on Information Theory"},{"key":"10.3233\/IDA-184190_ref26","unstructured":"P.S. Bradley, O.L. Mangasarian and W.N. Street, Clustering via concave minimization, in: Advances Neural Information Processing Systems, MIT PRESS, Denver, 1996, pp. 368\u2013374."},{"key":"10.3233\/IDA-184190_ref27","doi-asserted-by":"crossref","unstructured":"R.S. Silva, G.M.C. Gomes, M.S. Alvim and M.A. Goncalves, Compression-based selective sampling for learning to rank, in: 25th ACM International on Conference on Information and Knowledge Management, ACM, Indianapolis, 2016, pp. 247\u2013256.","DOI":"10.1145\/2983323.2983813"},{"key":"10.3233\/IDA-184190_ref28","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1109\/TPAMI.2011.142","article-title":"Prototype selection for nearest neighbor classification: Taxonomy and empirical study","volume":"34","author":"Garcia","year":"2012","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"key":"10.3233\/IDA-184190_ref29","doi-asserted-by":"crossref","first-page":"228","DOI":"10.1006\/jagm.1998.0993","article-title":"Greedy strikes back: improved facility location algorithms","volume":"31","author":"Guha","year":"1999","journal-title":"Journal of Algorithm"},{"key":"10.3233\/IDA-184190_ref30","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1126\/science.220.4598.671","article-title":"Optimization by simulated annealing","volume":"220","author":"Kirkpatrick","year":"1983","journal-title":"SCIENCE"},{"key":"10.3233\/IDA-184190_ref31","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1016\/j.ic.2012.01.007","article-title":"A 1.488 Approximation algorithm for the uncapacitated facility location problem","volume":"222","author":"Li","year":"2013","journal-title":"Information and Computation"},{"key":"10.3233\/IDA-184190_ref32","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1109\/TIT.1967.1053964","article-title":"Nearest neighbor pattern classification","volume":"13","author":"Cover","year":"1967","journal-title":"IEEE Transactions on Information Theory"},{"key":"10.3233\/IDA-184190_ref33","unstructured":"T. Yamane, Statistics: An Introductory Analysis, Book, Harper and Row, New York, 1967."},{"key":"10.3233\/IDA-184190_ref34","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1145\/235968.233324","article-title":"BIRCH: An efficient data clustering method for very large databases","author":"Zhang","year":"1996","journal-title":"ACM SIGMOD international conference on Management of data"},{"key":"10.3233\/IDA-184190_ref35","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1007\/s10462-004-0751-8","article-title":"Class noise vs. attribute noise: a quantitative study","volume":"22","author":"Zhu","year":"2004","journal-title":"Artificial Intelligence Review"}],"container-title":["Intelligent Data Analysis"],"original-title":[],"link":[{"URL":"https:\/\/content.iospress.com\/download?id=10.3233\/IDA-184190","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T09:18:25Z","timestamp":1777454305000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/full\/10.3233\/IDA-184190"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,9,26]]},"references-count":35,"journal-issue":{"issue":"4"},"URL":"https:\/\/doi.org\/10.3233\/ida-184190","relation":{},"ISSN":["1088-467X","1571-4128"],"issn-type":[{"value":"1088-467X","type":"print"},{"value":"1571-4128","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,9,26]]}}}