Binary Sketches for Secondary Filtering
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216224%3A14330%2F19%3A00107167" target="_blank" >RIV/00216224:14330/19:00107167 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1145/3231936" target="_blank" >http://dx.doi.org/10.1145/3231936</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1145/3231936" target="_blank" >10.1145/3231936</a>
Alternative languages
Result language
angličtina
Original language name
Binary Sketches for Secondary Filtering
Original language description
This paper addresses the problem of matching the most similar data objects to a given query object. We adopt a generic model of similarity that involves the domain of objects and metric distance functions only. We examine the case of a large dataset in a complex data space which makes this problem inherently difficult. Many indexing and searching approaches have been proposed but they have often failed to efficiently prune complex search spaces and access large portions of the dataset when evaluating queries. We propose an approach to enhancing the existing search techniques so as to significantly reduce the number of accessed data objects while preserving the quality of the search results. In particular, we extend each data object with its sketch, a short binary string in Hamming space. These sketches approximate the similarity relationships in the original search space, and we use them to filter out non-relevant objects not pruned by the original search technique. We provide a probabilistic model to tune the parameters of the sketch-based filtering separately for each query object. Experiments conducted with different similarity search techniques and real-life datasets demonstrate that the secondary filtering can speed-up similarity search several times.
Czech name
—
Czech description
—
Classification
Type
J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database
CEP classification
—
OECD FORD branch
10200 - Computer and information sciences
Result continuities
Project
<a href="/en/project/GBP103%2F12%2FG084" target="_blank" >GBP103/12/G084: Center for Large Scale Multi-modal Data Interpretation</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>S - Specificky vyzkum na vysokych skolach
Others
Publication year
2019
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Name of the periodical
ACM Transactions on Information Systems
ISSN
1046-8188
e-ISSN
1558-2868
Volume of the periodical
37
Issue of the periodical within the volume
1
Country of publishing house
US - UNITED STATES
Number of pages
28
Pages from-to
„1:1“-„1:28“
UT code for WoS article
000457519000001
EID of the result in the Scopus database
—