| NAOYA, Higuchi, Imamura YASUNOBU, Vladimír MÍČ, Shinohara TAKESHI, Hirata KOUICHI and Kuboyama TETSUJI. Pivot Selection for Narrow Sketches by Optimization Algorithms. In Shin'ichi Satoh, Lucia Vadicamo, Arthur Zimek, Fabio Carrara, Ilaria Bartolini, Martin Aumüller, Björn Þór JónssonRasmus Pagh. Similarity Search and Applications: 13th International Conference, SISAP 2020, Copenhagen, Denmark, September 30 - October 2, 2020, Proceedings. Cham: Springer, 2020, p. 33-46. ISBN 978-3-030-60935-1. Available from: https://dx.doi.org/10.1007/978-3-030-60936-8_3. |
Other formats:
BibTeX
LaTeX
RIS
@inproceedings{1686165,
author = {Naoya, Higuchi and Yasunobu, Imamura and Míč, Vladimír and Takeshi, Shinohara and Kouichi, Hirata and Tetsuji, Kuboyama},
address = {Cham},
booktitle = {Similarity Search and Applications: 13th International Conference, SISAP 2020, Copenhagen, Denmark, September 30 - October 2, 2020, Proceedings},
doi = {http://dx.doi.org/10.1007/978-3-030-60936-8_3},
editor = {Shin'ichi Satoh, Lucia Vadicamo, Arthur Zimek, Fabio Carrara, Ilaria Bartolini, Martin Aumüller, Björn Þór JónssonRasmus Pagh},
keywords = {Bit-string Sketch;Pivot Selection;Optimisation},
howpublished = {tištěná verze "print"},
language = {eng},
location = {Cham},
isbn = {978-3-030-60935-1},
pages = {33-46},
publisher = {Springer},
title = {Pivot Selection for Narrow Sketches by Optimization Algorithms},
url = {https://link.springer.com/chapter/10.1007/978-3-030-60936-8_3},
year = {2020}
}
TY - JOUR
ID - 1686165
AU - Naoya, Higuchi - Yasunobu, Imamura - Míč, Vladimír - Takeshi, Shinohara - Kouichi, Hirata - Tetsuji, Kuboyama
PY - 2020
TI - Pivot Selection for Narrow Sketches by Optimization Algorithms
PB - Springer
CY - Cham
SN - 9783030609351
KW - Bit-string Sketch;Pivot Selection;Optimisation
UR - https://link.springer.com/chapter/10.1007/978-3-030-60936-8_3
L2 - https://link.springer.com/chapter/10.1007/978-3-030-60936-8_3
N2 - 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.
ER -
NAOYA, Higuchi, Imamura YASUNOBU, Vladimír MÍČ, Shinohara TAKESHI, Hirata KOUICHI and Kuboyama TETSUJI. Pivot Selection for Narrow Sketches by Optimization Algorithms. In Shin'ichi Satoh, Lucia Vadicamo, Arthur Zimek, Fabio Carrara, Ilaria Bartolini, Martin Aumüller, Björn Þór JónssonRasmus Pagh. \textit{Similarity Search and Applications: 13th International Conference, SISAP 2020, Copenhagen, Denmark, September 30 - October 2, 2020, Proceedings}. Cham: Springer, 2020, p.~33-46. ISBN~978-3-030-60935-1. Available from: https://dx.doi.org/10.1007/978-3-030-60936-8\_{}3.
|
