Using the k-nearest neighbor graph for proximity searching in metric spaces

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3772 LNCS, Issue , 2005, Pages 127-138

  Paredes, Rodrigo ^a   Chávez, Edgar ^b  

^a UNIVERSITY OF CHILE   (Chile)

^b UNIVERSIDAD MICHOACANA DE SAN NICOLÁS DE HIDALGO   (Mexico)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; DATA COMPRESSION; DATABASE SYSTEMS; METRIC SYSTEM; PROBLEM SOLVING; QUERY LANGUAGES; SEARCH ENGINES;

KNNG GRAPH; METRIC SPACES; PROXIMITY SEARCHING;

GRAPH THEORY;

EID: 33646730696     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11575832_14     Document Type: Conference Paper

References (15)

1. R. Baeza-Yates, C. Hurtado, and M. Mendoza. Query clustering for boosting web page ranking. In Proc. AWIC'04, LNCS 3034, pages 164-175, 2004.
2. R. Baeza-Yates, C. Hurtado, and M. Mendoza. Query recommendation usign query logs in search engines. In Proc. EDBT Workshops'04, LNCS 3268, pages 588-596, 2004.
3. R. Baeza-Yates and B. Ribeiro-Neto. Modern Information Retrieval. Addison-Wesley, 1999.
4. M. Brito, E. Chávez, A. Quiroz, and J. Yukich. Connectivity of the mutual k-nearest neighbor graph in clustering and outlier detection. Statistics & Probability Letters, 35:33-42, 1996.
5. P. Callahan and R. Kosaraju. A decomposition of multidimensional point sets with applications to k nearest neighbors and n body potential fields. JACM, 42(1):67-90, 1995.
6. E. Chávez, G. Navarro, R. Baeza-Yates, and J.L. Marroquín. Searching in metric spaces. ACM Computing Surveys, 33(3):273-321, September 2001.
7. K. Clarkson. Nearest neighbor queries in metric spaces. Discrete Computational Geometry, 22(1):63-93, 1999.
8. R. O. Duda and P. Hart. Pattern Classification and Scene Analysis. Wiley, 1973.
9. D. Eppstein and J. Erickson. Iterated nearest neighbors and finding minimal polytopes. Discrete & Computational Geometry, 11:321-350, 1994.
10. K. Figueroa. An efficient algorithm to all k nearest neighbor problem in metric spaces. Master's thesis, Universidad Michoacana, Mexico, 2000. In Spanish.
11. G. Hjaltason and H. Samet. Incremental similarity search in multimedia databases. Technical Report TR 4199, Dept. of Comp. Sci. Univ. of Maryland, Nov 2000.
12. G. Navarro and R. Paredes. Practical construction of metric t-spanners. In Proc. ALENEX'03, pages 69-81, 2003.
13. G. Navarro, R. Paredes, and E. Chávez. t-Spanners as a data structure for metric space searching. In Proc. SPIRE'02, LNCS 2476, pages 298-309, 2002.
14. R. Paredes and G. Navarro. Practical construction of k nearest neighbor graphs in metric spaces. Technical Report TR/DCC-2005-6, Dept. of Comp. Sci. Univ. of Chile, May 2005. ftp://ftp.dcc.uchile.cl/pub/users/gnavarro/knnconstr. ps.gz.
15. E. Vidal. An algorithm for finding nearest neighbors in (approximately) constant average time. Pattern Recognition Letters, 4:145-157, 1986.