{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,9]],"date-time":"2026-05-09T04:24:58Z","timestamp":1778300698152,"version":"3.51.4"},"reference-count":21,"publisher":"Elsevier BV","issue":"9-10","license":[{"start":{"date-parts":[[2003,6,1]],"date-time":"2003-06-01T00:00:00Z","timestamp":1054425600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Pattern Recognition Letters"],"published-print":{"date-parts":[[2003,6]]},"DOI":"10.1016\/s0167-8655(02)00302-1","type":"journal-article","created":{"date-parts":[[2003,3,26]],"date-time":"2003-03-26T00:16:29Z","timestamp":1048637789000},"page":"1203-1213","source":"Crossref","is-referenced-by-count":7,"title":["Simple termination conditions for k-nearest neighbor method"],"prefix":"10.1016","volume":"24","author":[{"given":"Mineichi","family":"Kudo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Naoto","family":"Masuyama","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jun","family":"Toyama","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Masaru","family":"Shimbo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"9","key":"10.1016\/S0167-8655(02)00302-1_BIB1","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1145\/361002.361007","article-title":"Multidimensional binary search trees used for associative searching","volume":"18","author":"Bentley","year":"1975","journal-title":"Commun. ACM"},{"issue":"4","key":"10.1016\/S0167-8655(02)00302-1_BIB2","doi-asserted-by":"crossref","first-page":"563","DOI":"10.1145\/355921.355927","article-title":"Optimal expected-time algorithms for closest-point problems","volume":"6","author":"Bentley","year":"1980","journal-title":"ACM Trans. Math. Software"},{"key":"10.1016\/S0167-8655(02)00302-1_BIB3","unstructured":"Berchtold, S., Keim, D.A., Kriegel, H.-P., 1996. The X-tree: An index structure for high-dimensional data. Proc. 22nd VLDB Conference. pp. 28\u201339"},{"key":"10.1016\/S0167-8655(02)00302-1_BIB4","doi-asserted-by":"crossref","unstructured":"Berchtold, S., Ertl, B., Keim, D.A., Kriegel, H.-P., Seidl, T., 1998. Fast nearest neighbor search in high-dimensional spaces. Proc. 14th IEEE Conf. Data Engineering, ICDE. pp. 23\u201327","DOI":"10.1109\/ICDE.1998.655779"},{"key":"10.1016\/S0167-8655(02)00302-1_BIB5","doi-asserted-by":"crossref","unstructured":"Califano, A., Mohan, R., 1991. Multidimensional indexing for recognizing visual shapes. Proc. IEEE Conf. on Computer Vision and Pattern Recognition. pp. 28\u201334","DOI":"10.1109\/CVPR.1991.139656"},{"key":"10.1016\/S0167-8655(02)00302-1_BIB6","doi-asserted-by":"crossref","first-page":"625","DOI":"10.1016\/0167-8655(93)90047-H","article-title":"A hashing-oriented nearest neighbor searching scheme","volume":"14","author":"Chang","year":"1993","journal-title":"Pattern Recognit. Lett."},{"issue":"1","key":"10.1016\/S0167-8655(02)00302-1_BIB7","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1109\/TIT.1967.1053964","article-title":"Nearest neighbor pattern classification","volume":"IT-13","author":"Cover","year":"1967","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"3","key":"10.1016\/S0167-8655(02)00302-1_BIB8","doi-asserted-by":"crossref","first-page":"511","DOI":"10.1109\/21.278999","article-title":"Minimal consistent set (MCS) identification for optimal neighbor decision systems design","volume":"SMC-24","author":"Dasarathy","year":"1994","journal-title":"IEEE Trans. Syst. Man Cybernetics"},{"issue":"3","key":"10.1016\/S0167-8655(02)00302-1_BIB9","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1109\/34.584107","article-title":"A fast algorithm for the nearest-neighbor classifier","volume":"19","author":"Djouadi","year":"1997","journal-title":"IEEE Trans. Pattern Anal. Machine Intell."},{"key":"10.1016\/S0167-8655(02)00302-1_BIB10","doi-asserted-by":"crossref","first-page":"1000","DOI":"10.1109\/T-C.1975.224110","article-title":"An algorithm for finding nearest neighbors","author":"Friedman","year":"1975","journal-title":"IEEE Trans. Comput."},{"issue":"3","key":"10.1016\/S0167-8655(02)00302-1_BIB11","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1145\/355744.355745","article-title":"An algorithm for finding best matches in logarithm expected time","volume":"3","author":"Friedman","year":"1977","journal-title":"ACM Trans. Math. Software"},{"issue":"7","key":"10.1016\/S0167-8655(02)00302-1_BIB12","doi-asserted-by":"crossref","first-page":"750","DOI":"10.1109\/T-C.1975.224297","article-title":"A branch-and-bound algorithm for computing k-nearest neighbors","volume":"C-24","author":"Fukunaga","year":"1975","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/S0167-8655(02)00302-1_BIB13","series-title":"Introduction to Statistical Pattern Recognition","first-page":"268","article-title":"Nonparametric density estimation","author":"Fukunaga","year":"1990"},{"issue":"3","key":"10.1016\/S0167-8655(02)00302-1_BIB14","doi-asserted-by":"crossref","first-page":"431","DOI":"10.1109\/TIT.1972.1054809","article-title":"The reduced nearest neighbor rule","volume":"IT-18","author":"Gates","year":"1972","journal-title":"IEEE Trans. Inf. Theory"},{"key":"10.1016\/S0167-8655(02)00302-1_BIB15","doi-asserted-by":"crossref","unstructured":"Guttman, A., 1984. R-trees: A dynamic index structure for spatial searching. ACM SIGMOD. pp. 47\u201357","DOI":"10.1145\/602259.602266"},{"issue":"3","key":"10.1016\/S0167-8655(02)00302-1_BIB16","doi-asserted-by":"crossref","first-page":"515","DOI":"10.1109\/TIT.1968.1054155","article-title":"The condensed nearest neighbor rule","volume":"IT-14","author":"Hart","year":"1968","journal-title":"IEEE Trans. Inf. Theory"},{"key":"10.1016\/S0167-8655(02)00302-1_BIB17","doi-asserted-by":"crossref","unstructured":"Kleinberg, J.M., 1997. Two algorithms for nearest-neighbor search in high dimension. Proc. 29th Annu. ACM sympos. Theory Comput. pp. 599\u2013608","DOI":"10.1145\/258533.258653"},{"key":"10.1016\/S0167-8655(02)00302-1_BIB18","unstructured":"Murphy, P.M., Aha, D.W., 1991. UCI Repository of Machine Learning Databases [Machine-Readable Data Repository]. University of California, Department of Information and Computer Science, Irvine, California"},{"key":"10.1016\/S0167-8655(02)00302-1_BIB19","doi-asserted-by":"crossref","first-page":"989","DOI":"10.1109\/34.615448","article-title":"A simple algorithm for nearest neighbor search in high dimensions","volume":"19","author":"Nene","year":"1997","journal-title":"IEEE Trans. Pattern Anal. Machine Intell."},{"key":"10.1016\/S0167-8655(02)00302-1_BIB20","unstructured":"Sellis, T., Roussopoulos, N., Faloutos, C., 1987. The R+-tree: A dynamic index for multi-dimensional objects. Proc. 13th VLDB Conference. pp. 507\u2013517"},{"key":"10.1016\/S0167-8655(02)00302-1_BIB21","doi-asserted-by":"crossref","unstructured":"Wolfson, H.J., 1990. Model-based object recognition by geometric hashing. Proc. 1st European Conf. Computer Vision. pp. 526\u2013536","DOI":"10.1007\/BFb0014902"}],"container-title":["Pattern Recognition Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167865502003021?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167865502003021?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,3,11]],"date-time":"2020-03-11T23:36:15Z","timestamp":1583969775000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167865502003021"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,6]]},"references-count":21,"journal-issue":{"issue":"9-10","published-print":{"date-parts":[[2003,6]]}},"alternative-id":["S0167865502003021"],"URL":"https:\/\/doi.org\/10.1016\/s0167-8655(02)00302-1","relation":{},"ISSN":["0167-8655"],"issn-type":[{"value":"0167-8655","type":"print"}],"subject":[],"published":{"date-parts":[[2003,6]]}}}