Other formats:
BibTeX
LaTeX
RIS
@article{1180308,
author = {Novák, David and Zezula, Pavel},
article_location = {Oxford, UK},
article_number = {11},
doi = {http://dx.doi.org/10.1093/comjnl/bxt114},
keywords = {similarity search; metric space; multi-index; efficiency; robustness},
language = {eng},
issn = {0010-4620},
journal = {The Computer Journal},
title = {Performance Study of Independent Anchor Spaces for Similarity Searching},
url = {http://comjnl.oxfordjournals.org/content/57/11/1741},
volume = {57},
year = {2014}
}
TY - JOUR
ID - 1180308
AU - Novák, David - Zezula, Pavel
PY - 2014
TI - Performance Study of Independent Anchor Spaces for Similarity Searching
JF - The Computer Journal
VL - 57
IS - 11
SP - 1741-1755
EP - 1741-1755
PB - Oxford University Press
SN - 00104620
KW - similarity search
KW - metric space
KW - multi-index
KW - efficiency
KW - robustness
UR - http://comjnl.oxfordjournals.org/content/57/11/1741
L2 - http://comjnl.oxfordjournals.org/content/57/11/1741
N2 - 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. These techniques 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 the search costs. Further, we address the question of robustness of the answer quality, which can be significantly improved by utilization of independent anchor spaces.
ER -
NOVÁK, David and Pavel ZEZULA. Performance Study of Independent Anchor Spaces for Similarity Searching. \textit{The Computer Journal}. Oxford, UK: Oxford University Press, 2014, vol.~57, No~11, p.~1741-1755. ISSN~0010-4620. Available from: https://dx.doi.org/10.1093/comjnl/bxt114.
|
