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”

Performance Study of Independent Anchor Spaces for Similarity Searching

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216224%3A14330%2F14%3A00073219" target="_blank" >RIV/00216224:14330/14:00073219 - isvavai.cz</a>

  • Result on the web

    <a href="http://comjnl.oxfordjournals.org/content/57/11/1741" target="_blank" >http://comjnl.oxfordjournals.org/content/57/11/1741</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1093/comjnl/bxt114" target="_blank" >10.1093/comjnl/bxt114</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    Performance Study of Independent Anchor Spaces for Similarity Searching

  • Original language description

    This work targets the problem of search efficiency vs. answer quality of approximate metric-based similarity search. We especially focus on techniques based on recursive Voronoi-like partitioning or, from another perspective, on pivot permutations. Thesetechniques use sets of reference objects (anchors/pivots) to partition the metric space into cells of close data items. Instead of refining the search space by enlarging the anchor set of a single index, we propose to divide a large pivot set into several subsets and build multiple indexes with independent space partitioning; at query time, the overall search costs are also divided among the separate indexes. Our thorough experimental study on three different real datasets uncovers drawbacks of excessive increase of a single pivot set size?such partitioning refinement can be counterproductive beyond a certain number of pivots. Our approach overcomes the root causes of this limitation and increases the answer quality while preserving th

  • Czech name

  • Czech description

Classification

  • Type

    J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)

  • CEP classification

    IN - Informatics

  • OECD FORD branch

Result continuities

  • Project

    Result was created during the realization of more than one project. More information in the Projects tab.

  • Continuities

    P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Others

  • Publication year

    2014

  • 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

    The Computer Journal

  • ISSN

    0010-4620

  • e-ISSN

  • Volume of the periodical

    57

  • Issue of the periodical within the volume

    11

  • Country of publishing house

    GB - UNITED KINGDOM

  • Number of pages

    15

  • Pages from-to

    1741-1755

  • UT code for WoS article

  • EID of the result in the Scopus database