Algoritmos Genéticos para Consultas por Similaridade Aproximadas Renato Bueno, Agma J. M. Traina, and Caetano Traina Jr.   View Paper (PDF)   Return to Bibliotecas Digitais e Similaridade/Digital Libraries and Similarity Abstract 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. ©2006 Association for Computing Machinery