Approximate similarity search using samples

Authors:
Bilegsaikhan Naidan;Magnus Lie Hetland;Ole Edsberg
Affiliations:
Norwegian University of Science and Technology, Trondheim, Norway;Norwegian University of Science and Technology, Trondheim, Norway;Norwegian University of Science and Technology, Trondheim, Norway
Venue:
Proceedings of the Fourth International Conference on SImilarity Search and APplications
Year:
2011

Citing 3
Cited 0

Region proximity in metric spaces and its use for approximate similarity search

ACM Transactions on Information Systems (TOIS)
Approximate similarity retrieval with M-trees

The VLDB Journal — The International Journal on Very Large Data Bases
Clustering-based similarity search in metric spaces with sparse spatial centers

SOFSEM'08 Proceedings of the 34th conference on Current trends in theory and practice of computer science

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present an approximation technique for similarity queries in metric spaces seeking to reduce the number of distance computations required to process the query. The new technique could be applied to ball and hyperplane regions in metric index structures, but also to non-metric index structures such as generalized search trees. Experimental results show that our sampling based technique performed better than the relative error approximation technique, but worse than the region proximity technique.