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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.