Surrogate ranking for very expensive similarity queries

Abstract

We consider the problem of similarity search in applications where the cost of computing the similarity between two records is very expensive, and the similarity measure is not a metric. In such applications, comparing even a tiny fraction of the database records to a single query record can be orders of magnitude slower than reading the entire database… (More)
DOI: 10.1109/ICDE.2010.5447888

12 Figures and Tables

Topics

  • Presentations referencing similar topics