Algoritmos Genéticos para Consultas por Similaridade Aproximadas

Renato BuenoAgma J. M. TrainaCaetano Traina Jr.

The similarity search process on complex domains for exact answer is an expensive process. However, the multimedia data comparison operations usually consider some extracted features from the elements, instead of the elements themselves. Therefore, trading exact answering with query time response can be a worth exchange. In this work we developed two techniques based on genetic algorithms to allow retrieving approximate data indexed in a Metric Access Methods (MAMs) within a limited, user-defined, amount of time. Experimental evaluation shows that good results can be obtained in a fraction of the time required to obtain the exact answer.

Caso o link acima esteja inválido, faça uma busca pelo texto completo na Web: Buscar na Web

Biblioteca Digital Brasileira de Computação - Contato:
     Mantida por: