Simple termination conditions for k-nearest neighbor method

Pattern Recognition Letters

Volumn 24, Issue 9-10, 2003, Pages 1203-1213

  Kudo, Mineichi ^a   Masuyama, Naoto ^a   Toyama, Jun ^a   Shimbo, Masaru ^b  

^a HOKKAIDO UNIVERSITY   (Japan)

^b HOKKAIDO INFORMATION UNIVERSITY   (Japan)

Author keywords

Branch and bound algorithm; Pattern recognition; Termination condition; The k nearest neighbor method

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; PROBLEM SOLVING;

SEARCH PROCESSES;

PATTERN RECOGNITION;

NEAREST NEIGHBOR ANALYSIS;

EID: 0037410748     PISSN: 01678655     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0167-8655(02)00302-1     Document Type: Article

References (21)

1. Bentley, J.L., 1975. Multidimensional binary search trees used for associative searching. Commun. ACM 18 (9), 509-517.
2. Bentley, J.L., Weide, B.W., Yao, A.C., 1980. Optimal expected-time algorithms for closest-point problems. ACM Trans. Math. Software 6 (4), 563-580.
3. 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-39.
4. 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-27
5. Califano, A., Mohan, R., 1991. Multidimensional indexing for recognizing visual shapes. Proc. IEEE Conf. on Computer Vision and Pattern Recognition. pp. 28-34.
6. Chang, C.-C, Wu, T.-C., 1993. A hashing-oriented nearest neighbor searching scheme. Pattern Recognit. Lett. 14, 625-630.
7. Cover, T.M., Hart, P.E., 1967. Nearest neighbor pattern classification. IEEE Trans. Inf. Theory, IT-13(1), 21-27.
8. Dasarathy, B.V., 1994. Minimal consistent set (MCS) identification for optimal neighbor decision systems design. IEEE Trans. Syst. Man Cybernetics, SMC-24(3), 511-517.
9. Djouadi, A., Boutache, E., 1997. A fast algorithm for the nearest-neighbor classifier. IEEE Trans. Pattern Anal. Machine Intell. 19 (3), 277-282.
10. Friedman, J.H., Naskett, F., Shustek, L.J., 1975. An algorithm for finding nearest neighbors. IEEE Trans. Comput., 1000-1006.
11. Friedman, J.H., Bentley, J.L., Finkel, A., 1977. An algorithm for finding best matches in logarithm expected time. ACM Trans. Math. Software 3 (3), 209-226.
12. Fukunaga, K., Narendra, P.M. 1975. A branch-and-bound algorithm for computing k-nearest neighbors. IEEE Trans. Comput. C-24 (7), 750-753.
13. Fukunaga, K., 1990. Nonparametric density estimation. Introduction to Statistical Pattern Recognition, Academic Press, pp. 268-287.
14. Gates, G.W., 1972. The reduced nearest neighbor rule. IEEE Trans. Inf. Theory IT-18 (3), 431-433.
15. Guttman, A., 1984. R-trees: A dynamic index structure for spatial searching. ACM SIGMOD. pp. 47-57.
16. Hart, P.E., 1968. The condensed nearest neighbor rule. IEEE Trans. Inf. Theory IT-14 (3), 515-516.
17. Kleinberg, J.M., 1997. Two algorithms for nearest-neighbor search in high dimension. Proc. 29th Annu. ACM sympos. Theory Comput. pp. 599-608
18. 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.
19. Nene, S.A., Nayar, S.K., 1997. A simple algorithm for nearest neighbor search in high dimensions. IEEE Trans. Pattern Anal. Machine Intell. 19, 989-1003.
20. +-tree: A dynamic index for multi-dimensional objects. Proc. 13th VLDB Conference. pp. 507-517
21. Wolfson, H.J., 1990. Model-based object recognition by geometric hashing. Proc. 1st European Conf. Computer Vision. pp. 526-536.