A pruning rule based on a distance sparse table for hierarchical similarity search algorithms
Por favor, use este identificador para citar o enlazar este ítem:
http://hdl.handle.net/10045/9683
Título: | A pruning rule based on a distance sparse table for hierarchical similarity search algorithms |
---|---|
Autor/es: | Gómez Ballester, Eva | Micó, Luisa | Oncina, Jose |
Grupo/s de investigación o GITE: | Reconocimiento de Formas e Inteligencia Artificial |
Centro, Departamento o Servicio: | Universidad de Alicante. Departamento de Lenguajes y Sistemas Informáticos |
Palabras clave: | Fast nearest neighbour search | Metric space | Tree-based algorithms | Pruning rules |
Área/s de conocimiento: | Lenguajes y Sistemas Informáticos |
Fecha de creación: | 2008 |
Fecha de publicación: | 2008 |
Editor: | Springer Berlin / Heidelberg |
Cita bibliográfica: | GÓMEZ BALLESTER, Eva; MICÓ ANDRÉS, Luisa; ONCINA CARRATALÁ, Jose. "A pruning rule based on a distance sparse table for hierarchical similarity search algorithms". En: Structural, Syntactic, and Statistical Pattern Recognition : joint IAPR International Workshop, SSPR & SPR 2008, Orlando, USA, December 4-6, 2008 : proceedings. Berlin : Springer, 2008. (Lecture Notes in Computer Science; 5342/2008). ISBN 978-3-540-89688-3, pp. 926-936 |
Resumen: | Nearest neighbour search is a simple technique widely used in Pattern Recognition tasks. When the dataset is large and/or the dissimilarity computation is very time consuming the brute force approach is not practical. In such cases, some properties of the dissimilarity measure can be exploited in order to speed up the search. In particular, the metric properties of some dissimilarity measures have been used extensively in fast nearest neighbour search algorithms to avoid dissimilarity computations. Recently, a distance table based pruning rule to reduce the average number of distance computations in hierarchical search algorithms was proposed. In this work we show the effectiveness of this rule compared to other state of the art algorithms. Moreover, we propose some guidelines to reduce the space complexity of the rule. |
Patrocinador/es: | Spanish CICyT for partial support of this work through projects DPI2006-15542-C04-01, the IST Programme of the European Community, under the PASCAL Network of Excellence, IST–2002-506778, and the program CONSOLIDER INGENIO 2010 (CSD2007-00018). |
URI: | http://hdl.handle.net/10045/9683 |
ISBN: | 978-3-540-89688-3 |
ISSN: | 0302-9743 (Print) | 1611-3349 (Online) |
DOI: | 10.1007/978-3-540-89689-0_96 |
Idioma: | eng |
Tipo: | info:eu-repo/semantics/article |
Derechos: | The original publication is available at www.springerlink.com |
Revisión científica: | si |
Versión del editor: | http://dx.doi.org/10.1007/978-3-540-89689-0_96 |
Aparece en las colecciones: | INV - GRFIA - Artículos de Revistas |
Archivos en este ítem:
Archivo | Descripción | Tamaño | Formato | |
---|---|---|---|---|
spr-table.pdf | Versión final (acceso restringido) | 361,89 kB | Adobe PDF | Abrir Solicitar una copia |
Todos los documentos en RUA están protegidos por derechos de autor. Algunos derechos reservados.