{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,27]],"date-time":"2025-10-27T20:35:48Z","timestamp":1761597348011},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2012,4,27]],"date-time":"2012-04-27T00:00:00Z","timestamp":1335484800000},"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":[[2013,8]]},"DOI":"10.1007\/s13042-012-0091-y","type":"journal-article","created":{"date-parts":[[2012,4,26]],"date-time":"2012-04-26T04:31:47Z","timestamp":1335414707000},"page":"259-272","source":"Crossref","is-referenced-by-count":21,"title":["Probabilistic characterization of nearest neighbor classifier"],"prefix":"10.1007","volume":"4","author":[{"given":"Amit","family":"Dhurandhar","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alin","family":"Dobra","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2012,4,27]]},"reference":[{"key":"91_CR1","doi-asserted-by":"crossref","unstructured":"Abello J, Pardalos P, Resende M (eds) (2002) Handbook of massive data sets. Kluwer, Norwell","DOI":"10.1007\/978-1-4615-0005-6"},{"key":"91_CR2","doi-asserted-by":"crossref","unstructured":"Blum A, Kalai A, Langford J (1999) Beating the hold-out: bounds for k-fold and progressive cross-validation. In: Computational learing theory","DOI":"10.1145\/307400.307439"},{"key":"91_CR3","doi-asserted-by":"crossref","first-page":"593","DOI":"10.1007\/s00454-004-1152-0","volume":"33","author":"D Bremner","year":"2005","unstructured":"Bremner D, Demaine E, Erickson J, Iacono J, Langerman S, Morin P, Toussaint G (2005) Output-sensitive algorithms for computing nearest-neighbor decision boundaries. Discrete Comput Geom 33:593\u2013604","journal-title":"Discrete Comput Geom"},{"key":"91_CR4","unstructured":"Connor-Linton J (2003) Chi square tutorial. http:\/\/www.georgetown.edu\/faculty\/ballc\/webtools\/web_chi_tut.html"},{"key":"91_CR5","first-page":"2287","volume":"9","author":"A Dhurandhar","year":"2008","unstructured":"Dhurandhar A, Dobra A (2008) Probabilistic characterization of random decision trees. J Mach Learn Res 9:2287\u20132314","journal-title":"J Mach Learn Res"},{"key":"91_CR6","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/1497577.1497579","volume":"3","author":"A Dhurandhar","year":"2009","unstructured":"Dhurandhar A, Dobra A (2009) Semi-analytical method for analyzing models and model selection measures based on moment analysis. ACM Trans Knowl Discov Data 3:1\u201351","journal-title":"ACM Trans Knowl Discov Data"},{"key":"91_CR7","unstructured":"Duda R, Hart P, Stork D (2001) Pattern classification, 2 edn. Wiley, New York"},{"key":"91_CR8","doi-asserted-by":"crossref","unstructured":"Hall M, Holmes G (2003) Benchmarking attribute selection techniques for discrete class data mining. IEEE Trans KDE","DOI":"10.1109\/TKDE.2003.1245283"},{"key":"91_CR9","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1007\/s13042-010-0008-6","volume":"1","author":"Q Hu","year":"2010","unstructured":"Hu Q, Pan W, An S, Ma P, Wei J (2010) An efficient gene selection technique for cancer recognition based on neighborhood mutual information. Int J Mach Learn Cybern 1:63\u201374","journal-title":"Int J Mach Learn Cybern"},{"key":"91_CR10","unstructured":"Kohavi R (1995) A study of cross-validation and bootstrap for accuracy estimation and model selection. In: Proceedings of the fourteenth IJCAI"},{"key":"91_CR11","unstructured":"Krause E (1987) Taxicab geometry: an adventure in non-Euclidean geometry. Dover, New York"},{"key":"91_CR12","unstructured":"Liu W, White A (1997) Metrics for nearest neighbour discrimination with categorical attributes. In: Research and development in expert systems XIV: Proceedings of the 17th annual technicial conference of the BCES Specialist Group, pp 51\u201359"},{"key":"91_CR13","unstructured":"Maggini M, Giles C, Horne B (1997) Financial time series forecasting using k-nearest neighbors classification. In: Nonlinear financial forecasting, pp 169\u2013181"},{"key":"91_CR14","doi-asserted-by":"crossref","unstructured":"Moore A, Lee M (1994) Efficient algorithms for minimizing cross validation error. In: International conference on machine learning, pp 190\u2013198","DOI":"10.1016\/B978-1-55860-335-6.50031-3"},{"key":"91_CR15","doi-asserted-by":"crossref","first-page":"2412","DOI":"10.1021\/ci060149f","volume":"46","author":"F Nigsch","year":"2006","unstructured":"Nigsch F, Bender A, Buuren B, Tissen J, Nigsch E, Mitchell J (2006) Melting point prediction employing k-nearest neighbor algorithms and genetic parameter optimization. J Chem Inf Model 46:2412\u20132422","journal-title":"J Chem Inf Model"},{"key":"91_CR16","doi-asserted-by":"crossref","first-page":"2135","DOI":"10.1214\/07-AOS537","volume":"36","author":"B Park","year":"2008","unstructured":"Park B, Samworth R (2008) Choice of neighbor order in nearest-neighbor classification. Ann Stat 36:2135\u20132152","journal-title":"Ann Stat"},{"key":"91_CR17","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1007\/s13042-011-0037-9","volume":"3","author":"Y Qin","year":"2012","unstructured":"Qin Y, Zheng D, Zhao T (2012) Research on search results optimization technology with category features integration. Int J Mach Learn Cybern 3:71\u201376","journal-title":"Int J Mach Learn Cybern"},{"key":"91_CR18","doi-asserted-by":"crossref","first-page":"3089","DOI":"10.1029\/1999WR900028","volume":"35","author":"B Rajagopalan","year":"1999","unstructured":"Rajagopalan B, Lall U (1999) A k-nearest neighbor simulator for daily precipitation and other weather variables. Water Resour Res 35:3089\u20133101","journal-title":"Water Resour Res"},{"key":"91_CR19","doi-asserted-by":"crossref","unstructured":"Shao J (2003) Mathematical statistics. Springer, Berlin","DOI":"10.1007\/b97553"},{"key":"91_CR20","doi-asserted-by":"crossref","unstructured":"Sidorov G, Koeppen M, Cruz-Corts N (2011) Recent advances in machine learning techniques and applications. Int J Mach Learn Cybern 2:123\u2013124","DOI":"10.1007\/s13042-011-0033-0"},{"key":"91_CR21","first-page":"2844","volume":"21","author":"J Sim","year":"2005","unstructured":"Sim J, Kim S, Lee J (2005) Prediction of protein solvent accessibility using fuzzy k-nearest neighbor method. Bioinform Comput Appl Biosci 21:2844\u20132849","journal-title":"Bioinform Comput Appl Biosci"},{"issue":"12","key":"91_CR22","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. Commun ACM 29(12):1213\u20131228","journal-title":"Commun ACM"},{"issue":"4","key":"91_CR23","doi-asserted-by":"crossref","first-page":"595","DOI":"10.1214\/aos\/1176343886","volume":"5","author":"C Stone","year":"1977","unstructured":"Stone C (1977) Consistent nonparametric regression. Ann Stat 5(4):595\u2013645","journal-title":"Ann Stat"},{"key":"91_CR24","unstructured":"Vapnik V (1998) Statistical learning theory. Wiley, New York"},{"key":"91_CR25","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1016\/j.ic.2006.08.004","volume":"205","author":"K Yang","year":"2007","unstructured":"Yang K, Shahabi C (2007) An efficient k nearest neighbor search for multivariate time series. Inf Comput 205:65\u201398","journal-title":"Inf Comput"}],"container-title":["International Journal of Machine Learning and Cybernetics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13042-012-0091-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s13042-012-0091-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13042-012-0091-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,27]],"date-time":"2019-06-27T23:36:32Z","timestamp":1561678592000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s13042-012-0091-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,4,27]]},"references-count":25,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2013,8]]}},"alternative-id":["91"],"URL":"https:\/\/doi.org\/10.1007\/s13042-012-0091-y","relation":{},"ISSN":["1868-8071","1868-808X"],"issn-type":[{"value":"1868-8071","type":"print"},{"value":"1868-808X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,4,27]]}}}