loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
First International Workshop on Similarity Search and Applications (sisap 2008)
The Many Facets of Approximate Similarity Search
April 11-April 12
ISBN: 978-0-7695-3101-4
In this article, we review the major paradigms for approximate similarity queries and propose a classification schema that easily allows existing approaches to be compared along several independent coordinates. Then, we discuss the impact that scheduling of index nodes can have on performance and show that, unlike exact similarity queries, no provable optimal scheduling strategy exists for approximate queries. On the positive side, we show that optimal-on-the-average schedules are well-defined. We complete by critically reviewing methods for evaluating the quality of approximate results.
Citation:
Marco Patella, Paolo Ciaccia, "The Many Facets of Approximate Similarity Search," sisap, pp.10-21, First International Workshop on Similarity Search and Applications (sisap 2008), 2008
Usage of this product signifies your acceptance of the Terms of Use.