{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T12:15:09Z","timestamp":1742386509304},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540305064"},{"type":"electronic","value":"9783540324201"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11590316_9","type":"book-chapter","created":{"date-parts":[[2005,12,6]],"date-time":"2005-12-06T15:18:20Z","timestamp":1133882300000},"page":"60-69","source":"Crossref","is-referenced-by-count":13,"title":["Geometric Decision Rules for Instance-Based Learning Problems"],"prefix":"10.1007","author":[{"given":"Binay","family":"Bhattacharya","sequence":"first","affiliation":[]},{"given":"Kaustav","family":"Mukherjee","sequence":"additional","affiliation":[]},{"given":"Godfried","family":"Toussaint","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"9_CR1","doi-asserted-by":"crossref","unstructured":"Bhattacharya, B., Kaller, D.: Reference set thinning for the k-nearest neighbor decision rule. In: Proceedings of the 14th International Conference on Pattern Recognition, vol.\u00a01 (1998)","DOI":"10.1109\/ICPR.1998.711125"},{"key":"9_CR2","unstructured":"Bhattacharya, B.K.: Application of computational geometry to pattern recognition problems. Ph.d. thesis, School of Computer Science, McGill University (1982)"},{"key":"9_CR3","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1023\/A:1014043630878","volume":"6","author":"H. Brighton","year":"2002","unstructured":"Brighton, H., Mellish, C.: Advances in instance selection for instance-based learning algorithms. Data Mining and Knowledge Discovery\u00a06, 153\u2013172 (2002)","journal-title":"Data Mining and Knowledge Discovery"},{"key":"9_CR4","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.: A Probabilistic Theory of Pattern Recognition. Springer, Heidelberg (1996)"},{"key":"9_CR5","unstructured":"Houle, M.: SASH: A spatial approximation sample hierarchy for similarity search. Tech. Report RT-0517, IBM Tokyo Research Laboratory (2003)"},{"key":"9_CR6","doi-asserted-by":"publisher","first-page":"2178","DOI":"10.1109\/18.720536","volume":"44","author":"S.R. Kulkarni","year":"1998","unstructured":"Kulkarni, S.R., Lugosi, G., Venkatesh, S.S.: Learning pattern classification - a survey. IEEE Transactions on Information Theory\u00a044, 2178\u20132206 (1998)","journal-title":"IEEE Transactions on Information Theory"},{"key":"9_CR7","unstructured":"Merz, C.J., Murphy, P.M.: UCI repository of machine learning database, Internet, University of California. Department of Information and Computer Science, \n                    \n                      http:\/\/www.ics.uci.edu\/mlearn\/MLRepository.html"},{"key":"9_CR8","unstructured":"Mukherjee, K.: Application of the gabriel graph to instance-based learning. M.sc. project, School of Computing Science, Simon Fraser University (2004)"},{"key":"9_CR9","doi-asserted-by":"publisher","first-page":"820","DOI":"10.1109\/18.335893","volume":"40","author":"D. Psaltis","year":"1994","unstructured":"Psaltis, D., Snapp, R.R., Venkatesh, S.S.: On the finite sample performance of the nearest neighbor classifier. IEEE Transactions on Information Theory\u00a040, 820\u2013837 (1994)","journal-title":"IEEE Transactions on Information Theory"},{"key":"9_CR10","unstructured":"Toussaint, G.T., Bhattacharya, B.K., Poulsen, R.S.: The application of Voronoi diagrams to nonparametric decision rules. In: Computer Science and Statistics: The Interface, Atlanta, pp. 97\u2013108 (1985)"},{"key":"9_CR11","doi-asserted-by":"crossref","unstructured":"Toussaint, G.T., Poulsen, R.S.: Some new algorithms and software implementation methods for pattern recognition research. In: Proc. IEEE Int. Computer Software Applications Conf., Chicago, pp. 55\u201363 (1979)","DOI":"10.1109\/CMPSAC.1979.762465"},{"key":"9_CR12","doi-asserted-by":"publisher","first-page":"408","DOI":"10.1109\/TSMC.1972.4309137","volume":"2","author":"D.L. Wilson","year":"1972","unstructured":"Wilson, D.L.: Asymptotic properties of nearest neighbor rules using edited data. IEEE Transactions on Systems, Man and Cybernetics\u00a02, 408\u2013420 (1972)","journal-title":"IEEE Transactions on Systems, Man and Cybernetics"},{"key":"9_CR13","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1023\/A:1007626913721","volume":"38","author":"D. Randall Wilson","year":"2000","unstructured":"Randall Wilson, D., Martinez, T.R.: Reduction techniques for instance-based learning algorithms. Machine Learning\u00a038, 257\u2013286 (2000)","journal-title":"Machine Learning"}],"container-title":["Lecture Notes in Computer Science","Pattern Recognition and Machine Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11590316_9.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T06:50:13Z","timestamp":1619506213000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11590316_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540305064","9783540324201"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/11590316_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}