PASCAL - Pattern Analysis, Statistical Modelling and Computational Learning

Experimental Analysis of Insertion Costs in a Naïve Dynamic MDF-Tree
Luisa Mico and Jose Oncina
In: 4th Iberian Conference on Pattern Recognition and Imagen Analysis, 10-12 Jun 2009, Povoa do Varzim, Portugal.

Abstract

Similarity search is a widely employed technique in Pattern Recognition. In order to speed up the search many indexing techniques have been proposed. However, the majority of the proposed techniques are static, that is, a fixed training set is used to build up the index. This characteristic becomes a major problem when these techniques are used in dynamic (interactive) systems. In these systems updating the training set is necessary to improve its performance. In this work, we explore the surprising efficiency of a naïve algorithm that allows making incremental insertion in a previously known index: the MDF-tree

PDF - Requires Adobe Acrobat Reader or other PDF viewer.
EPrint Type:Conference or Workshop Item (Oral)
Project Keyword:Project Keyword UNSPECIFIED
Subjects:Learning/Statistics & Optimisation
Theory & Algorithms
ID Code:7413
Deposited By:Luisa Mico
Deposited On:17 March 2011