PCA-based branch and bound search algorithms for computing K nearest neighbors

Pattern Recognition Letters

Volumn 24, Issue 9-10, 2003, Pages 1437-1451

  D'haes, Wim ^a,b   van Dyck, Dick ^a   Rodet, Xavier ^b  

^a UNIVERSITY OF ANTWERP   (Belgium)

^b IRCAM   (France)

Author keywords

Branch and bound search algorithm; K nearest neighbors; Non parametric estimation; Principal component analysis

Indexed keywords

ALGORITHMS; COMPUTER SIMULATION; COSTS; DECOMPOSITION; IMAGE PROCESSING; MATHEMATICAL MODELS; PROBABILITY;

BOUND SEARCH ALGORITHMS;

PATTERN RECOGNITION;

PRINCIPAL COMPONENT ANALYSIS;

EID: 0037410616     PISSN: 01678655     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0167-8655(02)00384-7     Document Type: Article

References (16)

1. D'haes, W., Dyck, D. V., Rodet, X. (2002). An efficient branch and bound search algorithm for computing k nearest neighbors in a multidimensional vector space. IEEE Advanced Concepts Intelligent Vision Systems (ACIVS) (Septembeer).
2. Faragó A., Linder, T., Lugosi, G. (1993). Fast nearest neighbor search in dissimilarity spaces. IEEE Trans. Pattern Anal. Mach. Intell., 15 (September), 957-962.
3. Fukunaga, K. (1990). Statistical Pattern Recognition.: Academic Press.
4. Fukunaga, K., Nerada, P. M. (1975). A branch and bound algorithm for computing k nearest neighbors. IEEE Trans. Comput., 24 (July), 750-753.
5. Juan, A., Vidal, E., Aibar, P., 1998. Fast k nearest neighbor searching through extended versions of the approximating and eliminating search algorithm (AESA). In: Proceedings of the 14th ICPR, vol. I, pp. 828-830.
6. Kamgar-Parsi, B. (1985). An improved branch and bound algorithm for computing k nearest neighbors. Pattern Recogn. Lett. 3 (January), 7-12.
7. Kim, B. S., Park, S. B. (1986). A fast k nearest neighbor finding algorithm based on the ordered partition. IEEE Trans. Pattern Anal. Mach. Intell. 8 (6), 761-766.
8. McNames, J. (2001). A fast nearest neighbor algorithm based on a principal axis search tree. IEEE Trans. Pattern Anal. Mach. Intell. 23 (9), 964-976.
9. Micó, M. L., Oncina, J., Carrasco, R. C. (1996). A fast branch and bound nearest neighbor classifier in metric spaces. Pattern Recogn. Lett. 17 (June), 731-739.
10. Micó, M.L., Oncina, J., Vidal, E., 1992. An algorithm for finding nearest neighbors in constant average time with a linear space complexity. In: Proceedings of the 11th ICPR, vol. II, pp. 557-560
11. Micó, M. L., Oncina, J., Vidal, E. (1994). A new version of the nearest-neighbour approximation and elimination search alorithm (AESA) with linear preprocessing time and memory requirements. Pattern Recogn. Lett., 15(January), 9-18.
12. Niemann, H., Goppert, R. (1988). An efficient branch and bound nearest neighbour classifier. Pattern Recogn. Lett. 7 (February), 67-72.
13. Ramasubramanian, V., Paliwal, K. K. (2000). Fast nearest neighbor search algorithms based on approximation-elimination search. Pattern Recogn. 33, 1497-1510.
14. Vidal, E. (1986). An algorithm for finding nearest neighbors in (approximately) constant average time complexity. Pattern Recogn. Lett. 4 (July), 145-157.
15. Vidal, E. (1994). New formulation and improvements of the nearest neighbour approximation and elimination search alorithm (AESA). Pattern Recogn. Lett. 15 (January), 1-7.
16. Vilar, J. (1996). Reducing the overhead of the AESA metric-space nearest neighbor searching algorithm. Inform. Process. Lett. 56, 265-271.