{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T15:10:05Z","timestamp":1778253005254,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540225706","type":"print"},{"value":"9783540278689","type":"electronic"}],"license":[{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-27868-9_97","type":"book-chapter","created":{"date-parts":[[2010,9,16]],"date-time":"2010-09-16T06:52:23Z","timestamp":1284619943000},"page":"885-893","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A Nearest Neighbor Method Using Bisectors"],"prefix":"10.1007","author":[{"given":"Mineichi","family":"Kudo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hideyuki","family":"Imai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Akira","family":"Tanaka","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tetsuya","family":"Murai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"97_CR1","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1109\/TIT.1967.1053964","volume":"13","author":"T.M. Cover","year":"1967","unstructured":"Cover, T.M., Hart, P.E.: Nearest neighbor pattern classification. IEEE Trans. Information Theory\u00a0IT-13(1), 21\u201327 (1967)","journal-title":"IEEE Trans. Information Theory"},{"issue":"3","key":"97_CR2","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1109\/TIT.1968.1054155","volume":"14","author":"P.E. Hart","year":"1968","unstructured":"Hart, P.E.: The condensed nearest neighbor rule. IEEE Trans. Information Theory\u00a0IT-14(3), 515\u2013516 (1968)","journal-title":"IEEE Trans. Information Theory"},{"issue":"3","key":"97_CR3","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1109\/TIT.1972.1054809","volume":"18","author":"G.W. Gates","year":"1972","unstructured":"Gates, G.W.: The reduced nearest neighbor rule. IEEE Trans. Information Theory\u00a0IT-18(3), 431\u2013433 (1972)","journal-title":"IEEE Trans. Information Theory"},{"issue":"3","key":"97_CR4","doi-asserted-by":"publisher","first-page":"511","DOI":"10.1109\/21.278999","volume":"24","author":"B.V. Dasarathy","year":"1994","unstructured":"Dasarathy, B.V.: Minimal consistent set(MCS) identification for optimal neighbor decision systems design. IEEE Trans. Systems, Man, & Cybernetics\u00a0SMC-24(3), 511\u2013517 (1994)","journal-title":"IEEE Trans. Systems, Man, & Cybernetics"},{"issue":"7","key":"97_CR5","doi-asserted-by":"publisher","first-page":"750","DOI":"10.1109\/T-C.1975.224297","volume":"24","author":"K. Fukunaga","year":"1975","unstructured":"Fukunaga, K., Narendra, P.M.: A branch-and-bound algorithm for computing knearest neighbors. IEEE Trans. Computers\u00a0C-24(7), 750\u2013753 (1975)","journal-title":"IEEE Trans. Computers"},{"key":"97_CR6","doi-asserted-by":"publisher","first-page":"625","DOI":"10.1016\/0167-8655(93)90047-H","volume":"14","author":"C.-C. Chang","year":"1993","unstructured":"Chang, C.-C., Wu, T.-C.: A hashing-oriented nearest neighbor searching scheme. Pattern Recognition Letters\u00a014, 625\u2013630 (1993)","journal-title":"Pattern Recognition Letters"},{"key":"97_CR7","first-page":"268","volume-title":"Nonparametric Density Estimation, in Introduction to Statistical Pattern Recognition","author":"K. Fukunaga","year":"1990","unstructured":"Fukunaga, K.: Nonparametric Density Estimation, in Introduction to Statistical Pattern Recognition, pp. 268\u2013287. Academic Press, London (1990)"},{"key":"97_CR8","unstructured":"Murphy, P.M., Aha, D.W.: UCI Repository of Machine Learning Databases [Machine-Readable Data Repository]. University of California, Department of Information and Computer Science, Irvine, California (1991)"},{"key":"97_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"276","DOI":"10.1007\/3-540-44634-6_26","volume-title":"Algorithms and Data Structures","author":"S. Maneewongvatana","year":"2001","unstructured":"Maneewongvatana, S., Mount, D.M.: The Analysis of a Probabilistic Approach to Nearest Neighbor Searching. In: Dehne, F., Sack, J.-R., Tamassia, R. (eds.) WADS 2001. LNCS, vol.\u00a02125, pp. 276\u2013286. Springer, Heidelberg (2001)"},{"key":"97_CR10","doi-asserted-by":"publisher","first-page":"891","DOI":"10.1145\/293347.293348","volume":"45","author":"S. Arya","year":"1998","unstructured":"Arya, S., Mount, D.M., Netanyahu, N.S., Silverman, R., Wu, A.Y.: An optimal algorithm for approximate nearest neighbor searching. Journal of the ACM\u00a045, 891\u2013923 (1998)","journal-title":"Journal of the ACM"},{"key":"97_CR11","doi-asserted-by":"crossref","unstructured":"Kleinberg, J.: Two algorithms for nearest-neighbor search in high dimensions. In: Proc. 29th ACM Symposium on Theory of Computing, pp. 599\u2013608 (1997)","DOI":"10.1145\/258533.258653"},{"key":"97_CR12","doi-asserted-by":"publisher","first-page":"1213","DOI":"10.1016\/S0167-8655(02)00302-1","volume":"24","author":"M. Kudo","year":"2003","unstructured":"Kudo, M., Masuyama, N., Shimbo, M.: Simple termination conditions for knearest neighbor method. Pattern Recognition Letters\u00a024, 1213\u20131223 (2003)","journal-title":"Pattern Recognition Letters"}],"container-title":["Lecture Notes in Computer Science","Structural, Syntactic, and Statistical Pattern Recognition"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-27868-9_97","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T14:15:58Z","timestamp":1778249758000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-540-27868-9_97"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540225706","9783540278689"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-27868-9_97","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2004]]},"assertion":[{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}