Pivot Selection for Narrow Sketches by Optimization Algorithms

D 2020

Pivot Selection for Narrow Sketches by Optimization Algorithms

NAOYA, Higuchi, Imamura YASUNOBU, Vladimír MÍČ, Shinohara TAKESHI, Hirata KOUICHI et. al.

Basic information

Original name

Pivot Selection for Narrow Sketches by Optimization Algorithms

Authors

NAOYA, Higuchi, Imamura YASUNOBU, Vladimír MÍČ (203 Czech Republic, guarantor, belonging to the institution), Shinohara TAKESHI, Hirata KOUICHI and Kuboyama TETSUJI

Edition

Cham, Similarity Search and Applications: 13th International Conference, SISAP 2020, Copenhagen, Denmark, September 30 - October 2, 2020, Proceedings, p. 33-46, 14 pp. 2020

Publisher

Springer

Other information

Language

English

Type of outcome

Stať ve sborníku

Field of Study

10201 Computer sciences, information science, bioinformatics

Country of publisher

Switzerland

Confidentiality degree

není předmětem státního či obchodního tajemství

Publication form

printed version "print"

References:

URL

Impact factor

Impact factor: 0.402 in 2005

RIV identification code

RIV/00216224:14330/20:00116700

Organization unit

Faculty of Informatics

ISBN

978-3-030-60935-1

ISSN

DOI

http://dx.doi.org/10.1007/978-3-030-60936-8_3

UT WoS

000616694200003

Keywords in English

Bit-string Sketch;Pivot Selection;Optimisation

Abstract

V originále

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.

Links

EF16_019/0000822, research and development project

Name: Centrum excelence pro kyberkriminalitu, kyberbezpečnost a ochranu kritických informačních infrastruktur

Citovat

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.

@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.

Detailed Information on Publication Record