{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T12:08:58Z","timestamp":1763467738634},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540345978"},{"type":"electronic","value":"9783540345985"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11764298_8","type":"book-chapter","created":{"date-parts":[[2006,5,19]],"date-time":"2006-05-19T08:37:56Z","timestamp":1148027876000},"page":"85-97","source":"Crossref","is-referenced-by-count":36,"title":["Practical Construction of k-Nearest Neighbor Graphs in Metric Spaces"],"prefix":"10.1007","author":[{"given":"Rodrigo","family":"Paredes","sequence":"first","affiliation":[]},{"given":"Edgar","family":"Ch\u00e1vez","sequence":"additional","affiliation":[]},{"given":"Karina","family":"Figueroa","sequence":"additional","affiliation":[]},{"given":"Gonzalo","family":"Navarro","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"8_CR1","unstructured":"Arya, S., Mount, D., Netanyahu, N., Silverman, R., Wu, A.: An optimal algorithm for approximate nearest neighbor searching in fixed dimension. In: Proc. SODA 1994, pp. 573\u2013583 (1994)"},{"key":"8_CR2","doi-asserted-by":"crossref","unstructured":"Aurenhammer, F.: Voronoi diagrams \u2013 a survey of a fundamental geometric data structure. ACM Computing Surveys\u00a023(3) (1991)","DOI":"10.1145\/116873.116880"},{"key":"8_CR3","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":"8_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"},{"key":"8_CR5","doi-asserted-by":"crossref","unstructured":"Callahan, P.: Optimal parallel all-nearest-neighbors using the well-separated pair decomposition. In: Proc. FOCS 1993, pp. 332\u2013340 (1993)","DOI":"10.1109\/SFCS.1993.366854"},{"issue":"1","key":"8_CR6","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":"9","key":"8_CR7","doi-asserted-by":"publisher","first-page":"1363","DOI":"10.1016\/j.patrec.2004.11.014","volume":"26","author":"E. Ch\u00e1vez","year":"2005","unstructured":"Ch\u00e1vez, E., Navarro, G.: A compact space decomposition for effective metric indexing. Pattern Recognition Letters\u00a026(9), 1363\u20131376 (2005)","journal-title":"Pattern Recognition Letters"},{"issue":"3","key":"8_CR8","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., Marroquin, J.L.: Searching in metric spaces. ACM Computing Surveys\u00a033(3), 273\u2013321 (2001)","journal-title":"ACM Computing Surveys"},{"key":"8_CR9","doi-asserted-by":"crossref","unstructured":"Clarkson, K.: Fast algorithms for the all-nearest-neighbors problem. In: Proc. FOCS 1983, pp. 226\u2013232 (1983)","DOI":"10.1109\/SFCS.1983.16"},{"issue":"1","key":"8_CR10","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":"8_CR11","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1016\/0925-7721(95)00009-7","volume":"5","author":"M. Dickerson","year":"1996","unstructured":"Dickerson, M., Eppstein, D.: Algorithms for proximity problems in higher dimensions. Computational Geometry Theory and Applications\u00a05, 277\u2013291 (1996)","journal-title":"Computational Geometry Theory and Applications"},{"key":"8_CR12","volume-title":"Pattern Classification and Scene Analysis","author":"R. Duda","year":"1973","unstructured":"Duda, R., Hart, P.: Pattern Classification and Scene Analysis. Wiley, Chichester (1973)"},{"key":"8_CR13","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-61568-9","volume-title":"Algorithms in Combinatorial Geometry","author":"H. Edelsbrunner","year":"1987","unstructured":"Edelsbrunner, H.: Algorithms in Combinatorial Geometry. Springer, Heidelberg (1987)"},{"key":"8_CR14","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":"8_CR15","unstructured":"Figueroa, K.: An efficient algorithm to all k nearest neighbor problem in metric spaces. Master\u2019s thesis, Universidad Michoacana, Mexico (in Spanish, 2000)"},{"key":"8_CR16","unstructured":"Hjaltason, G., Samet, H.: Incremental similarity search in multimedia databases. Technical Report TR 4199, Dept. of Comp. Sci. Univ. of Maryland (November 2000)"},{"issue":"5","key":"8_CR17","doi-asserted-by":"publisher","first-page":"631","DOI":"10.1109\/TSE.1983.235263","volume":"9","author":"I. Kalantari","year":"1983","unstructured":"Kalantari, I., McDonald, G.: A data structure and an algorithm for the nearest point problem. IEEE Trans. Software Eng.\u00a09(5), 631\u2013634 (1983)","journal-title":"IEEE Trans. Software Eng."},{"key":"8_CR18","doi-asserted-by":"crossref","unstructured":"Karger, D.R., Ruhl, M.: Finding nearest neighbors in growth-restricted metrics. In: Proc. STOC 2002, pp. 741\u2013750 (2002)","DOI":"10.1145\/509907.510013"},{"key":"8_CR19","unstructured":"Krauthgamer, R., Lee, J.: Navigating nets: simple algorithms for proximity search. In: Proc. SODA 2004, pp. 798\u2013807 (2004)"},{"key":"8_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/11575832_14","volume-title":"String Processing and Information Retrieval","author":"R. Paredes","year":"2005","unstructured":"Paredes, R., Ch\u00e1vez, E.: Using the k-nearest neighbor graph for proximity searching in metric spaces. In: Consens, M.P., Navarro, G. (eds.) SPIRE 2005. LNCS, vol.\u00a03772, pp. 127\u2013138. Springer, Heidelberg (2005)"},{"key":"8_CR21","unstructured":"R Development Core Team. R: A language and environment for statistical computing. R Foundation for Statistical Computing, Vienna, Austria (2004)"},{"key":"8_CR22","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1007\/BF02187718","volume":"4","author":"P. Vaidya","year":"1989","unstructured":"Vaidya, P.: An O(nlogn) algorithm for the all-nearest-neighbor problem. Discrete & Computational Geometry\u00a04, 101\u2013115 (1989)","journal-title":"Discrete & Computational Geometry"}],"container-title":["Lecture Notes in Computer Science","Experimental Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11764298_8.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:10:59Z","timestamp":1619507459000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11764298_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540345978","9783540345985"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/11764298_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}