A constant average time algorithm to allow insertions in the LAESA fast Nearest Neighbour Search index
Por favor, use este identificador para citar o enlazar este ítem:
http://hdl.handle.net/10045/15376
Registro completo de metadatos
Campo DC | Valor | Idioma |
---|---|---|
dc.contributor | Reconocimiento de Formas e Inteligencia Artificial | en |
dc.contributor.author | Micó, Luisa | - |
dc.contributor.author | Oncina, Jose | - |
dc.contributor.other | Universidad de Alicante. Departamento de Lenguajes y Sistemas Informáticos | en |
dc.date.accessioned | 2010-11-16T10:42:52Z | - |
dc.date.available | 2010-11-16T10:42:52Z | - |
dc.date.created | 2010-08-23 | - |
dc.date.issued | 2010-10-07 | - |
dc.identifier.citation | MICÓ ANDRÉS, Luisa; ONCINA CARRATALÁ, Jose. "A constant average time algorithm to allow insertions in the LAESA fast Nearest Neighbour Search index". En: Proceedings of the 20th International Conference on Pattern Recognition, ICPR 2010 : 23-26 Aug. 2010, Istanbul, Turkey. Piscataway, N.J. : IEEE, 2010. ISBN 978-0-7695-4109-9, pp. 3911-3914 | en |
dc.identifier.isbn | 978-0-7695-4109-9 | - |
dc.identifier.uri | http://hdl.handle.net/10045/15376 | - |
dc.description.abstract | Nearest Neighbour search is a widely used technique in Pattern Recognition. In order to speed up the search many indexing techniques have been proposed. However, most of the proposed techniques are static, that is, once the index is built the incorporation of new data is not possible unless a costly rebuilt of the index is performed. The main effect is that changes in the environment are very costly to be taken into account. In this work, we propose a technique to allow the insertion of elements in the LAESA index. The resulting index is exactly the same as the one that would be obtained by building it from scratch. In this paper we also obtain an upper bound for its expected running time. Surprisingly, this bound is independent of the database size. | en |
dc.description.sponsorship | This work has been supported in part by grants TIN2009-14205-C04-01 from the Spanish CICYT (Ministerio de Ciencia e Innovación), the IST Programme of the European Community, under the Pascal Network of Excellence, IST-2002-506778, and the program CONSOLIDER INGENIO 2010 (CSD2007-00018). | en |
dc.language | eng | en |
dc.publisher | IEEE Computer Society | en |
dc.rights | © Copyright 2010 IEEE | en |
dc.subject | Nearest neighbour | en |
dc.subject | Metric spaces | en |
dc.subject | Distance | en |
dc.subject | Insertion | en |
dc.subject | Index | en |
dc.subject.other | Lenguajes y Sistemas Informáticos | en |
dc.title | A constant average time algorithm to allow insertions in the LAESA fast Nearest Neighbour Search index | en |
dc.type | info:eu-repo/semantics/conferenceObject | en |
dc.peerreviewed | si | en |
dc.identifier.doi | 10.1109/ICPR.2010.951 | - |
dc.relation.publisherversion | http://dx.doi.org/10.1109/ICPR.2010.951 | en |
dc.rights.accessRights | info:eu-repo/semantics/openAccess | - |
Aparece en las colecciones: | INV - GRFIA - Comunicaciones a Congresos, Conferencias, etc. |
Archivos en este ítem:
Archivo | Descripción | Tamaño | Formato | |
---|---|---|---|---|
icpr2010_ThBT2.4.pdf | 403,71 kB | Adobe PDF | Abrir Vista previa | |
Todos los documentos en RUA están protegidos por derechos de autor. Algunos derechos reservados.