All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

Sketches with Unbalanced Bits for Similarity Search

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216224%3A14330%2F17%3A00095051" target="_blank" >RIV/00216224:14330/17:00095051 - isvavai.cz</a>

  • Result on the web

    <a href="http://dx.doi.org/10.1007/978-3-319-68474-1_4" target="_blank" >http://dx.doi.org/10.1007/978-3-319-68474-1_4</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1007/978-3-319-68474-1_4" target="_blank" >10.1007/978-3-319-68474-1_4</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    Sketches with Unbalanced Bits for Similarity Search

  • Original language description

    In order to accelerate efficiency of similarity search, compact bit-strings compared by the Hamming distance, so called sketches, have been proposed as a form of dimensionality reduction. To maximize the data compression and, at the same time, minimize the loss of information, sketches typically have the following two properties: (1) each bit divides datasets approximately in halves, i.e. bits are balanced, and (2) individual bits have low pairwise correlations, preferably zero. It has been shown that sketches with such properties are minimal with respect to the retained information. However, they are very difficult to index due to the dimensionality curse -- the range of distances is rather narrow and the distance to the nearest neighbour is high. We suggest to use sketches with unbalanced bits and we analyse their properties both analytically and experimentally. We show that such sketches can achieve practically the same quality of similarity search and they are much easier to index thanks to the decrease of distances to the nearest neighbours.

  • Czech name

  • Czech description

Classification

  • Type

    D - Article in proceedings

  • CEP classification

  • OECD FORD branch

    10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

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

    2017

  • 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

  • Article name in the collection

    Similarity Search and Applications: 10th International Conference, SISAP 2017, Munich, Germany, October 4-6, 2017, Proceedings

  • ISBN

    9783319684741

  • ISSN

  • e-ISSN

  • Number of pages

    11

  • Pages from-to

    53-63

  • Publisher name

    Springer International Publishing

  • Place of publication

    Cham

  • Event location

    Mnichov, Německo

  • Event date

    Oct 4, 2017

  • Type of event by nationality

    WRD - Celosvětová akce

  • UT code for WoS article