Dynamic Insertions in TLAESA Fast NN Search Algorithm

Abstract

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 increasing interest in adapting or creating fast methods to update these indexes. TLAESA is a fast search algorithm with sub linear overhead that, using of a branch and bound technique, can find the nearest neighbour computing a very low number of distance computations. 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 experiments.