L
Título: Which fast nearest neighbour search algorithm to use?
Autores: Serrano Díaz-Carrasco, Aureo
Micó Andrés, Luisa
Oncina Carratalá, Jose
Fecha: 2013-10-04
2013-10-04
2013
Publicador: Springer Berlin / Heidelberg
Fuente: Ver documento
Tipo: info:eu-repo/semantics/conferenceObject
Tema: Nearest Neighbour
Search algorithms
Lenguajes y Sistemas Informáticos
Descripción: Choosing which fast Nearest Neighbour search algorithm to use depends on the task we face. Usually kd-tree search algorithm is selected when the similarity function is the Euclidean or the Manhattan distances. Generic fast search algorithms (algorithms that works with any distance function) are only used when there is not specific fast search algorithms for the involved distance function. In this work we show that in real data problems generic search algorithms (i.e. MDF-tree) can be faster that specific ones (i.e. kd-tree).
The authors thank the Spanish CICyT for partial support of this work through project TIN2009-14205-C04-C1 and la Consellería de Educación de la Comunidad Valenciana through project PROMETEO/2012/01.
Idioma: Inglés
Artículos similares:
Choosing the correct paradigm for unknown words in rule-based machine translation systems por Sánchez Cartagena, Víctor Manuel,Esplà Gomis, Miquel,Sánchez Martínez, Felipe,Pérez Ortiz, Juan Antonio
Using external sources of bilingual information for on-the-fly word alignment por Esplà Gomis, Miquel,Sánchez Martínez, Felipe,Forcada Zubizarreta, Mikel L.
10