About: Stabilizing the Recall in Similarity Search

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

About: Stabilizing the Recall in Similarity Search 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
Description	The recent techniques for approximate similarity search focus on optimizing answer precision/recall and they typically improve the average of these measures over a set of sample queries. However, according to our observation, the recall for particular indexes and queries can fluctuate considerably. In order to stabilize the recall, we propose a query-evaluation model that exploits several variants of the search index. This approach is applicable to a signicant subset of current approximate methods with a focus on techniques based purely on metric postulates. Applying this approach to the M-Index structure, we perform extensive measurements on large datasets and we show that this approach has a positive impact on the recall stability and it suppresses the most unsatisfactory cases. Further, the results indicate that the proposed approach can also increase the general average recall for given overall search costs. The recent techniques for approximate similarity search focus on optimizing answer precision/recall and they typically improve the average of these measures over a set of sample queries. However, according to our observation, the recall for particular indexes and queries can fluctuate considerably. In order to stabilize the recall, we propose a query-evaluation model that exploits several variants of the search index. This approach is applicable to a signicant subset of current approximate methods with a focus on techniques based purely on metric postulates. Applying this approach to the M-Index structure, we perform extensive measurements on large datasets and we show that this approach has a positive impact on the recall stability and it suppresses the most unsatisfactory cases. Further, the results indicate that the proposed approach can also increase the general average recall for given overall search costs. (en)
Title	Stabilizing the Recall in Similarity Search Stabilizing the Recall in Similarity Search (en)
skos:prefLabel	Stabilizing the Recall in Similarity Search Stabilizing the Recall in Similarity Search (en)
skos:notation	RIV/00216224:14330/11:00073202!RIV15-MV0-14330___
http://linked.open...avai/riv/aktivita	P S
http://linked.open...avai/riv/aktivity	P(GA201/09/0683), P(GAP103/10/0886), P(GPP202/10/P220), P(VF20102014004), S
http://linked.open...vai/riv/dodaniDat	2015
http://linked.open...aciTvurceVysledku	Zezula, Pavel Novák, David Kyselák, Martin
http://linked.open.../riv/druhVysledku	D - Článek ve sborníku
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	231881
http://linked.open...ai/riv/idVysledku	RIV/00216224:14330/11:00073202
http://linked.open...riv/jazykVysledku	eng - angličtina
http://linked.open.../riv/klicovaSlova	locality-sensitive hashing; metric space; similarity search; recall; stability (en)
http://linked.open.../riv/klicoveSlovo	similarity search metric space locality-sensitive hashing stability recall
http://linked.open...ontrolniKodProRIV	[C5AE13BE0C14]
http://linked.open...v/mistoKonaniAkce	Lipary, Italy
http://linked.open...i/riv/mistoVydani	New York
http://linked.open...i/riv/nazevZdroje	Fourth International Conference on Similarity Search and Applications, SISAP 2011
http://linked.open...in/vavai/riv/obor	IN
http://linked.open...ichTvurcuVysledku	3 (xsd:int)
http://linked.open...cetTvurcuVysledku	3 (xsd:int)
http://linked.open...vavai/riv/projekt	Similarity searching in very large multimedia databases Content-based Image Retrieval on the Web Scale Efficient Similarity Search with Constant Scalability Multimedia Analysis
http://linked.open...UplatneniVysledku	2011
http://linked.open...iv/tvurceVysledku	Novák, David Zezula, Pavel Kyselák, Martin
http://linked.open...vavai/riv/typAkce	WRD - Světová
http://linked.open.../riv/zahajeniAkce	2011-06-30 (xsd:date)
number of pages	8 (xsd:int)
http://bibframe.org/vocab/doi	10.1145/1995412.1995422
http://purl.org/ne...btex#hasPublisher	ACM Press
https://schema.org/isbn	9781450307956
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, 77 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software