Informace o publikaci

Pivot Selection for Narrow Sketches by Optimization Algorithms

Logo poskytovatele
Autoři

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

Rok publikování 2020
Druh Článek ve sborníku
Konference Similarity Search and Applications: 13th International Conference, SISAP 2020, Copenhagen, Denmark, September 30 - October 2, 2020, Proceedings
Fakulta / Pracoviště MU

Fakulta informatiky

Citace
www 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
Klíčová slova Bit-string Sketch;Pivot Selection;Optimisation
Popis 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.
Související projekty:

Používáte starou verzi internetového prohlížeče. Doporučujeme aktualizovat Váš prohlížeč na nejnovější verzi.

Další info