About: Performance Study of Independent Anchor Spaces for Similarity Searching

Facets (new session)
Description
Metadata
Settings
- owl:sameAs
- Inference Rule:

About: Performance Study of Independent Anchor Spaces for Similarity Searching Goto Sponge NotDistinct Permalink

An Entity of Type : http://linked.opendata.cz/ontology/domain/vavai/Vysledek, within Data Space : linked.opendata.cz associated with source document(s)

Attributes	Values
rdf:type	skos:Concept http://linked.opendata.cz/ontology/domain/vavai/Vysledek
rdfs:seeAlso	http://comjnl.oxfordjournals.org/content/57/11/1741
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. 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. 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. (en)
Title	Performance Study of Independent Anchor Spaces for Similarity Searching Performance Study of Independent Anchor Spaces for Similarity Searching (en)
skos:prefLabel	Performance Study of Independent Anchor Spaces for Similarity Searching Performance Study of Independent Anchor Spaces for Similarity Searching (en)
skos:notation	RIV/00216224:14330/14:00073219!RIV15-MV0-14330___
http://linked.open...avai/riv/aktivita	P
http://linked.open...avai/riv/aktivity	P(GBP103/12/G084), P(VG20122015073)
http://linked.open...iv/cisloPeriodika	11
http://linked.open...vai/riv/dodaniDat	2015
http://linked.open...aciTvurceVysledku	Zezula, Pavel Novák, David
http://linked.open.../riv/druhVysledku	J - Článek v odborném periodiku
http://linked.open...iv/duvernostUdaju	S - Úplné a pravdivé údaje nepodléhající ochraně podle zvláštních právních předpisů
http://linked.open...titaPredkladatele	Masarykova univerzita / Fakulta informatiky
http://linked.open...dnocenehoVysledku	36176
http://linked.open...ai/riv/idVysledku	RIV/00216224:14330/14:00073219
http://linked.open...riv/jazykVysledku	eng - angličtina
http://linked.open.../riv/klicovaSlova	similarity search; metric space; multi-index; efficiency; robustness (en)
http://linked.open.../riv/klicoveSlovo	multi-index similarity search metric space efficiency robustness
http://linked.open...odStatuVydavatele	GB - Spojené království Velké Británie a Severního Irska
http://linked.open...ontrolniKodProRIV	[AAB5BFC3302C]
http://linked.open...i/riv/nazevZdroje	The Computer Journal
http://linked.open...in/vavai/riv/obor	IN
http://linked.open...ichTvurcuVysledku	2 (xsd:int)
http://linked.open...cetTvurcuVysledku	2 (xsd:int)
http://linked.open...vavai/riv/projekt	Center for Large Scale Multi-modal Data Interpretation Efficient Searching in Large Biometric Data
http://linked.open...UplatneniVysledku	2014
http://linked.open...v/svazekPeriodika	57
http://linked.open...iv/tvurceVysledku	Novák, David Zezula, Pavel
issn	0010-4620
number of pages	15 (xsd:int)
http://bibframe.org/vocab/doi	10.1093/comjnl/bxt114
http://localhost/t...ganizacniJednotka	14330

Faceted Search & Find service v1.16.118 as of Jun 21 2024

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 07.20.3240 as of Jun 21 2024, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (126 GB total memory, 112 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software