Pivot Selection for Narrow Sketches by Optimization Algorithms

Investor logo

Warning

This publication doesn't include Institute of Computer Science. It includes Faculty of Informatics. Official publication website can be found on muni.cz.

Authors

NAOYA Higuchi YASUNOBU Imamura MÍČ Vladimír TAKESHI Shinohara KOUICHI Hirata TETSUJI Kuboyama

Year of publication 2020
Type Article in Proceedings
Conference Similarity Search and Applications: 13th International Conference, SISAP 2020, Copenhagen, Denmark, September 30 - October 2, 2020, Proceedings
MU Faculty or unit

Faculty of Informatics

Citation
Web https://link.springer.com/chapter/10.1007/978-3-030-60936-8_3
Doi http://dx.doi.org/10.1007/978-3-030-60936-8_3
Keywords Bit-string Sketch;Pivot Selection;Optimisation
Description Sketches are compact bit strings that are considered as products of an LSH for high-dimensional data. We use them in filtering for narrowing down solution candidates in similarity search. We propose a pivot selection method for narrow sketches with a length such as 16-bits by optimization algorithms with the accuracy of filtering itself as the objective function.
Related projects:

You are running an old browser version. We recommend updating your browser to its latest version.

More info