- Micó, L.; Oncina, J.
"Dynamic Insertions in TLAESA fast NN Search Algorithm"
Proceedings of the 22nd International Conference on Pattern Recognition, ICPR, ISBN: 978-1-4799-5208-3, Stockholm, Sweden
Nearest Neighbour search (NNS) is a widely used
technique in Pattern Recognition. In order to speed up the search many indexing techniques have been proposed. The need to work with large dynamic databases in interactive or online systems, has resulted in an increase interest in adapting or
creating fast methods to update these indexes. TLAESA is a fast search algorithm that computes a very low number of distance computations with sublinear overhead using a branch and bound technique.
In this paper, we propose a new fast updating method for the
TLAESA index. The behaviour of this index has been analysed
theoretical and experimentally. We have obtained a log-square
upper bound of the rebuilding expected time. This bound has
been verified experimentally on several synthetic and real data
author = "Micó, L.; Oncina, J.",
title = "Dynamic Insertions in TLAESA fast NN Search Algorithm",
address = "Stockholm, Sweden",
booktitle = "Proceedings of the 22nd International Conference on Pattern Recognition, ICPR",
isbn = "978-1-4799-5208-3",
year = "2014"