{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,17]],"date-time":"2025-04-17T15:27:50Z","timestamp":1744903670047,"version":"3.37.3"},"reference-count":39,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2010,5,29]],"date-time":"2010-05-29T00:00:00Z","timestamp":1275091200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Mach Learn"],"published-print":{"date-parts":[[2010,12]]},"DOI":"10.1007\/s10994-010-5170-2","type":"journal-article","created":{"date-parts":[[2010,5,28]],"date-time":"2010-05-28T18:06:33Z","timestamp":1275069993000},"page":"229-256","source":"Crossref","is-referenced-by-count":14,"title":["Bayesian instance selection for the nearest neighbor rule"],"prefix":"10.1007","volume":"81","author":[{"given":"Sylvain","family":"Ferrandiz","sequence":"first","affiliation":[]},{"given":"Marc","family":"Boull\u00e9","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2010,5,29]]},"reference":[{"issue":"2","key":"5170_CR1","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1016\/0020-7373(92)90018-G","volume":"36","author":"D. W. Aha","year":"1992","unstructured":"Aha, D. W. (1992). Tolerating noisy, irrelevant and novel attributes in instance-based learning algorithms. International Journal of Man-Machine Studies, 36(2), 267\u2013287.","journal-title":"International Journal of Man-Machine Studies"},{"key":"5170_CR2","first-page":"37","volume":"6","author":"D. Aha","year":"1991","unstructured":"Aha, D., Kibler, D., & Albert, M. (1991). Instance-based learning algorithms. Machine Learning, 6, 37\u201366.","journal-title":"Machine Learning"},{"key":"5170_CR3","unstructured":"Asuncion, A., & Newman, D. (2007). UCI Machine Learning Repository. Irvine, CA: University of California, School of Information and Computer Science. http:\/\/www.ics.uci.edu\/~mlearn\/MLRepository.html ."},{"key":"5170_CR4","unstructured":"Berndt, D., & Clifford, J. (1996). Finding patterns in time series: a dynamic programming approach (Tech. rep.). Advances Knowledge Discovery Data Mining."},{"key":"5170_CR5","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1007\/11590316_9","volume-title":"PReMI","author":"B. K. Bhattacharya","year":"2005","unstructured":"Bhattacharya, B. K., Mukherjee, K., & Toussaint, G. T. (2005). Geometric decision rules for instance-based learning problems. In S. K. Pal, S. Bandyopadhyay, & S. Biswas (Eds.), Lecture notes in computer science : Vol. 3776. PReMI (pp.\u00a060\u201369). Berlin: Springer."},{"issue":"2","key":"5170_CR6","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 Mining and Knowledge Discovery, 6(2), 153\u2013172.","journal-title":"Data Mining and Knowledge Discovery"},{"key":"5170_CR7","doi-asserted-by":"crossref","unstructured":"Bunke, H. (2000). Recent developments in graph matching. In ICPR (pp.\u00a02117\u20132124).","DOI":"10.1109\/ICPR.2000.906030"},{"key":"5170_CR8","unstructured":"Cameron-Jones, R. (1995). Instance selection by encoding length heuristic with random mutation hill climbing. In Proceedings of the eighth Australian joint conference on artificial intelligence (pp.\u00a099\u2013106)."},{"issue":"11","key":"5170_CR9","first-page":"1179","volume":"23","author":"C. Chang","year":"1991","unstructured":"Chang, C. (1991). Finding prototypes for nearest neighbor classifiers. IEEE Transactions on Computers, 23(11), 1179\u20131184.","journal-title":"IEEE Transactions on Computers"},{"key":"5170_CR10","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1109\/TIT.1967.1053964","volume":"13","author":"T. Cover","year":"1967","unstructured":"Cover, T., & Hart, P. (1967). Nearest neighbor pattern classification. Institute of Electrical and Electronics Engineers Transactions on Information Theory, 13, 21\u201327.","journal-title":"Institute of Electrical and Electronics Engineers Transactions on Information Theory"},{"key":"5170_CR11","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0711-5","volume-title":"A probabilistic theory of pattern recognition","author":"L. Devroye","year":"1996","unstructured":"Devroye, L., Gy\u00f6rfi, L., & Lugosi, G. (1996). A probabilistic theory of pattern recognition. Berlin: Springer."},{"key":"5170_CR12","volume-title":"Pattern classification","author":"R. Duda","year":"2001","unstructured":"Duda, R., Hart, P., & Stork, D. (2001). Pattern classification. New York: Wiley."},{"issue":"3","key":"5170_CR13","doi-asserted-by":"crossref","first-page":"269","DOI":"10.3233\/IDA-2006-10306","volume":"10","author":"S. Ferrandiz","year":"2006","unstructured":"Ferrandiz, S., & Boull\u00e9, M. (2006). Supervised evaluation of Voronoi partitions. Intelligent Data Analysis, 10(3), 269\u2013284.","journal-title":"Intelligent Data Analysis"},{"key":"5170_CR14","unstructured":"Fix, E., & Hodges, J. (1951). Discriminatory analysis. Nonparametric discrimination: consistency properties (Technical Report 4). Project Number 21-49-004, USAF School of Aviation Medicine, Randolph Field, TX."},{"issue":"3","key":"5170_CR15","doi-asserted-by":"crossref","first-page":"431","DOI":"10.1109\/TIT.1972.1054809","volume":"18","author":"G. Gates","year":"1972","unstructured":"Gates, G. (1972). The reduced nearest neighbor rule. IEEE Transactions on Information Theory, 18(3), 431\u2013433.","journal-title":"IEEE Transactions on Information Theory"},{"key":"5170_CR16","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/1114.001.0001","volume-title":"Advances in minimum description length: theory and applications","author":"P. Gr\u00fcnwald","year":"2005","unstructured":"Gr\u00fcnwald, P., Myung, I., & Pitt, M. (2005). Advances in minimum description length: theory and applications. Cambridge: MIT Press."},{"key":"5170_CR17","first-page":"1157","volume":"3","author":"I. Guyon","year":"2003","unstructured":"Guyon, I., & Elisseeff, A. (2003). An introduction to variable and feature selection. Journal of Machine Learning Research, 3, 1157\u20131182.","journal-title":"Journal of Machine Learning Research"},{"key":"5170_CR18","doi-asserted-by":"crossref","first-page":"449","DOI":"10.1016\/S0377-2217(00)00100-4","volume":"130","author":"P. Hansen","year":"2001","unstructured":"Hansen, P., & Mladenovic, N. (2001). Variable neighborhood search: principles and applications. European Journal of Operational Research, 130, 449\u2013467.","journal-title":"European Journal of Operational Research"},{"key":"5170_CR19","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 Transactions on Information Theory, 14, 515\u2013516.","journal-title":"IEEE Transactions on Information Theory"},{"issue":"9","key":"5170_CR20","doi-asserted-by":"crossref","first-page":"1502","DOI":"10.1109\/5.163414","volume":"80","author":"J. Jaromczyk","year":"1992","unstructured":"Jaromczyk, J., & Toussaint, G. (1992). Relative neighborhood graphs and their relatives. Proceedings of the IEEE, 80(9), 1502\u20131517.","journal-title":"Proceedings of the IEEE"},{"key":"5170_CR21","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-56927-2","volume-title":"Self-organizing maps","author":"T. Kohonen","year":"2001","unstructured":"Kohonen, T. (2001). Self-organizing maps (3rd ed.). Berlin: Springer.","edition":"3"},{"issue":"8","key":"5170_CR22","first-page":"707","volume":"10","author":"V. Levenshtein","year":"1966","unstructured":"Levenshtein, V. (1966). Binary codes capable of correcting deletions, insertions, and reversals. Soviet Physics Doklady, 10(8), 707\u2013710.","journal-title":"Soviet Physics Doklady"},{"key":"5170_CR23","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-3359-4","volume-title":"Instance selection and construction for data mining","author":"H. Liu","year":"2001","unstructured":"Liu, H., & Motoda, H. (2001). Instance selection and construction for data mining. Dordrecht: Kluwer."},{"key":"5170_CR24","unstructured":"MacQueen, J. (1967). Some methods for classification and analysis of multivariate observations. In L. Cam, & Neyman (Eds.), Fifth Berkeley symposium on mathematical statistics and probability (pp.\u00a0281\u2013297)."},{"issue":"3","key":"5170_CR25","doi-asserted-by":"crossref","first-page":"1065","DOI":"10.1214\/aoms\/1177704472","volume":"33","author":"E. Parzen","year":"1962","unstructured":"Parzen, E. (1962). On estimation of a probability density function and mode. Annals of Mathematical Statistics, 33(3), 1065\u20131076.","journal-title":"Annals of Mathematical Statistics"},{"key":"5170_CR26","volume-title":"The Bayesian choice: from decision-theoretic motivations to computational implementation","author":"C. Robert","year":"2001","unstructured":"Robert, C. (2001). The Bayesian choice: from decision-theoretic motivations to computational implementation. New York: Springer."},{"key":"5170_CR27","first-page":"277","volume":"6","author":"S. Salzberg","year":"1991","unstructured":"Salzberg, S. (1991). A nearest hyperrectangle learning method. Machine Learning, 6, 277\u2013309.","journal-title":"Machine Learning"},{"issue":"6","key":"5170_CR28","doi-asserted-by":"crossref","first-page":"507","DOI":"10.1016\/S0167-8655(97)00035-4","volume":"18","author":"J. S. Sanchez","year":"1997","unstructured":"Sanchez, J. S., Pla, F., & Ferri, F. J. (1997). Prototype selection for the nearest neighbour rule through proximity graphs. Pattern Recognition Letters, 18(6), 507\u2013513.","journal-title":"Pattern Recognition Letters"},{"key":"5170_CR29","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/4175.001.0001","volume-title":"Learning with kernels: support vector machines, regularization, optimization, and beyond","author":"B. Scholkopf","year":"2001","unstructured":"Scholkopf, B., & Smola, A. (2001). Learning with kernels: support vector machines, regularization, optimization, and beyond. Cambridge: MIT Press."},{"key":"5170_CR30","first-page":"863","volume":"3","author":"M. Sebban","year":"2002","unstructured":"Sebban, M., Nock, R., & Lallich, S. (2002). Stopping criterion for boosting-based data reduction techniques: from binary to multiclass problem. Journal of Machine Learning Research, 3, 863\u2013885.","journal-title":"Journal of Machine Learning Research"},{"key":"5170_CR31","doi-asserted-by":"crossref","first-page":"1213","DOI":"10.1145\/7902.7906","volume":"29","author":"C. Stanfill","year":"1986","unstructured":"Stanfill, C., & Waltz, D. (1986). Toward memory-based reasoning. Communications of the ACM, 29, 1213\u20131228.","journal-title":"Communications of the ACM"},{"key":"5170_CR32","unstructured":"Toussaint, G. T., Bhattacharya, B., & Poulsen, R. (1985). The application of Voronoi diagrams to nonparametric decision rules. In Computer science and statistics: the interface (pp. 97\u2013108)."},{"key":"5170_CR33","unstructured":"Toussaint, G. T., & Poulsen, R. (1975). Some new algorithms and software implementation methods for pattern recognition research. In Proceedings of the international computer software applications conference (pp.\u00a055\u201363)."},{"key":"5170_CR34","volume-title":"The nature of statistical learning theory","author":"V. Vapnik","year":"1996","unstructured":"Vapnik, V. (1996). The nature of statistical learning theory. New York: Springer."},{"issue":"1","key":"5170_CR35","first-page":"5","volume":"19","author":"D. Wettschereck","year":"1995","unstructured":"Wettschereck, D., & Dietterich, T. (1995). An experimental comparison of the nearest neighbor and nearest hyperrectangle algorithms. Machine Learning, 19(1), 5\u201327.","journal-title":"Machine Learning"},{"key":"5170_CR36","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 Transactions on Systems, Man and Cybernetics, 2, 408\u2013421.","journal-title":"IEEE Transactions on Systems, Man and Cybernetics"},{"issue":"1","key":"5170_CR37","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1613\/jair.346","volume":"6","author":"D. Wilson","year":"1997","unstructured":"Wilson, D., & Martinez, T. (1997a). Improved heterogeneous distance functions. Journal of Artificial Intelligence Research, 6(1), 1\u201334.","journal-title":"Journal of Artificial Intelligence Research"},{"key":"5170_CR38","first-page":"403","volume-title":"Proceedings of the 14th international conference on machine learning","author":"D. Wilson","year":"1997","unstructured":"Wilson, D., & Martinez, T. (1997b). Instance pruning techniques. In D. Fisher (Ed.), Proceedings of the 14th international conference on machine learning (pp. 403\u2013411). San Francisco: Morgan Kaufmann."},{"issue":"3","key":"5170_CR39","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1023\/A:1007626913721","volume":"38","author":"D. Wilson","year":"2000","unstructured":"Wilson, D., & Martinez, T. (2000). Reduction techniques for instance-based learning algorithms. Machine Learning, 38(3), 257\u2013286.","journal-title":"Machine Learning"}],"container-title":["Machine Learning"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-010-5170-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10994-010-5170-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-010-5170-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T10:17:32Z","timestamp":1740133052000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10994-010-5170-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,5,29]]},"references-count":39,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2010,12]]}},"alternative-id":["5170"],"URL":"https:\/\/doi.org\/10.1007\/s10994-010-5170-2","relation":{},"ISSN":["0885-6125","1573-0565"],"issn-type":[{"type":"print","value":"0885-6125"},{"type":"electronic","value":"1573-0565"}],"subject":[],"published":{"date-parts":[[2010,5,29]]}}}