Selecting Sketches for Similarity Search
| Authors | |
|---|---|
| Year of publication | 2018 |
| Type | Article in Proceedings |
| Conference | Advances in Databases and Information Systems : 22nd European Conference, ADBIS 2018, Budapest, Hungary, September 2-5, 2018. |
| MU Faculty or unit | |
| Citation | |
| Doi | http://dx.doi.org/10.1007/978-3-319-98398-1_9 |
| Keywords | bit string sketches;similarity search;selecting technique |
| Description | Many techniques transforming metric spaces into Hamming spaces to speed up searching exist. Their ability to approximate pairwise distances is data dependent and their fair comparison is expensive. We have proposed a way to efficiently estimate capability of particular transformation techniques to approximate original distances using just a small sample set of data. |
| Related projects: |