{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,21]],"date-time":"2026-05-21T12:40:10Z","timestamp":1779367210316,"version":"3.53.0"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540297406","type":"print"},{"value":"9783540322412","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11575832_14","type":"book-chapter","created":{"date-parts":[[2005,10,13]],"date-time":"2005-10-13T14:12:50Z","timestamp":1129212770000},"page":"127-138","source":"Crossref","is-referenced-by-count":44,"title":["Using the k-Nearest Neighbor Graph for Proximity Searching in Metric Spaces"],"prefix":"10.1007","author":[{"given":"Rodrigo","family":"Paredes","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Edgar","family":"Ch\u00e1vez","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"14_CR1","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1007\/978-3-540-24681-7_19","volume-title":"Advances in Web Intelligence","author":"R. Baeza-Yates","year":"2004","unstructured":"Baeza-Yates, R., Hurtado, C., Mendoza, M.: Query clustering for boosting web page ranking. In: Favela, J., Menasalvas, E., Ch\u00e1vez, E. (eds.) AWIC 2004. LNCS (LNAI), vol.\u00a03034, pp. 164\u2013175. Springer, Heidelberg (2004)"},{"key":"14_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"588","DOI":"10.1007\/978-3-540-30192-9_58","volume-title":"Current Trends in Database Technology - EDBT 2004 Workshops","author":"R. Baeza-Yates","year":"2004","unstructured":"Baeza-Yates, R., Hurtado, C., Mendoza, M.: Query recommendation usign query logs in search engines. In: Lindner, W., Mesiti, M., T\u00fcrker, C., Tzitzikas, Y., Vakali, A.I. (eds.) EDBT 2004. LNCS, vol.\u00a03268, pp. 588\u2013596. Springer, Heidelberg (2004)"},{"key":"14_CR3","volume-title":"Modern Information Retrieval","author":"R. Baeza-Yates","year":"1999","unstructured":"Baeza-Yates, R., Ribeiro-Neto, B.: Modern Information Retrieval. Addison-Wesley, Reading (1999)"},{"key":"14_CR4","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1016\/S0167-7152(96)00213-1","volume":"35","author":"M. Brito","year":"1996","unstructured":"Brito, M., Ch\u00e1vez, E., Quiroz, A., Yukich, J.: Connectivity of the mutual k-nearest neighbor graph in clustering and outlier detection. Statistics & Probability Letters\u00a035, 33\u201342 (1996)","journal-title":"Statistics & Probability Letters"},{"issue":"1","key":"14_CR5","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1145\/200836.200853","volume":"42","author":"P. Callahan","year":"1995","unstructured":"Callahan, P., Kosaraju, R.: A decomposition of multidimensional point sets with applications to k nearest neighbors and n body potential fields. JACM\u00a042(1), 67\u201390 (1995)","journal-title":"JACM"},{"issue":"3","key":"14_CR6","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1145\/502807.502808","volume":"33","author":"E. Ch\u00e1vez","year":"2001","unstructured":"Ch\u00e1vez, E., Navarro, G., Baeza-Yates, R., Marroqu\u00edn, J.L.: Searching in metric spaces. ACM Computing Surveys\u00a033(3), 273\u2013321 (2001)","journal-title":"ACM Computing Surveys"},{"issue":"1","key":"14_CR7","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1007\/PL00009449","volume":"22","author":"K. Clarkson","year":"1999","unstructured":"Clarkson, K.: Nearest neighbor queries in metric spaces. Discrete Computational Geometry\u00a022(1), 63\u201393 (1999)","journal-title":"Discrete Computational Geometry"},{"key":"14_CR8","volume-title":"Pattern Classification and Scene Analysis","author":"R.O. Duda","year":"1973","unstructured":"Duda, R.O., Hart, P.: Pattern Classification and Scene Analysis. Wiley, Chichester (1973)"},{"key":"14_CR9","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1007\/BF02574012","volume":"11","author":"D. Eppstein","year":"1994","unstructured":"Eppstein, D., Erickson, J.: Iterated nearest neighbors and finding minimal polytopes. Discrete & Computational Geometry\u00a011, 321\u2013350 (1994)","journal-title":"Discrete & Computational Geometry"},{"key":"14_CR10","unstructured":"Figueroa, K.: An efficient algorithm to all k nearest neighbor problem in metric spaces. Master\u2019s thesis, Universidad Michoacana, Mexico (2000) (In Spanish)"},{"key":"14_CR11","unstructured":"Hjaltason, G., Samet, H.: Incremental similarity search in multimedia databases. Technical Report TR 4199, Dept. of Comp. Sci. Univ. of Maryland (November 2000)"},{"key":"14_CR12","unstructured":"Navarro, G., Paredes, R.: Practical construction of metric t-spanners. In: Proc. ALENEX 2003, pp. 69\u201381 (2003)"},{"key":"14_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"298","DOI":"10.1007\/3-540-45735-6_26","volume-title":"String Processing and Information Retrieval","author":"G. Navarro","year":"2002","unstructured":"Navarro, G., Paredes, R., Ch\u00e1vez, E.: t-Spanners as a data structure for metric space searching. In: Laender, A.H.F., Oliveira, A.L. (eds.) SPIRE 2002. LNCS, vol.\u00a02476, pp. 298\u2013309. Springer, Heidelberg (2002)"},{"key":"14_CR14","doi-asserted-by":"crossref","unstructured":"Paredes, R., Navarro, G.: 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","DOI":"10.1007\/11764298_8"},{"key":"14_CR15","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1016\/0167-8655(86)90013-9","volume":"4","author":"E. Vidal","year":"1986","unstructured":"Vidal, E.: An algorithm for finding nearest neighbors in (approximately) constant average time. Pattern Recognition Letters\u00a04, 145\u2013157 (1986)","journal-title":"Pattern Recognition Letters"}],"container-title":["Lecture Notes in Computer Science","String Processing and Information Retrieval"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11575832_14.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T19:58:00Z","timestamp":1605643080000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11575832_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540297406","9783540322412"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/11575832_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005]]}}}