About: Rank Aggregation of Candidate Sets for Efficient Similarity Search

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

About: Rank Aggregation of Candidate Sets for Efficient 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	Many current applications need to organize data with respect to mutual similarity between data objects. Generic similarity retrieval in large data collections is a tough task that has been drawing researchers’ attention for two decades. A typical general strategy to retrieve the most similar objects to a given example is to access and then refine a candidate set of objects; the overall search costs (and search time) then typically correlate with the candidate set size. We propose a generic approach that combines several independent indexes by aggregating their candidate sets in such a way that the resulting candidate set can be one or two orders of magnitude smaller (while keeping the answer quality). This achievement comes at the expense of higher computational costs of the ranking algorithm but experiments on two real-life and one artificial datasets indicate that the overall gain can be significant. Many current applications need to organize data with respect to mutual similarity between data objects. Generic similarity retrieval in large data collections is a tough task that has been drawing researchers’ attention for two decades. A typical general strategy to retrieve the most similar objects to a given example is to access and then refine a candidate set of objects; the overall search costs (and search time) then typically correlate with the candidate set size. We propose a generic approach that combines several independent indexes by aggregating their candidate sets in such a way that the resulting candidate set can be one or two orders of magnitude smaller (while keeping the answer quality). This achievement comes at the expense of higher computational costs of the ranking algorithm but experiments on two real-life and one artificial datasets indicate that the overall gain can be significant. (en)
Title	Rank Aggregation of Candidate Sets for Efficient Similarity Search Rank Aggregation of Candidate Sets for Efficient Similarity Search (en)
skos:prefLabel	Rank Aggregation of Candidate Sets for Efficient Similarity Search Rank Aggregation of Candidate Sets for Efficient Similarity Search (en)
skos:notation	RIV/00216224:14330/14:00073743!RIV15-GA0-14330___
http://linked.open...avai/riv/aktivita	P
http://linked.open...avai/riv/aktivity	P(GBP103/12/G084)
http://linked.open...vai/riv/dodaniDat	2015
http://linked.open...aciTvurceVysledku	Zezula, Pavel Novák, David
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	41336
http://linked.open...ai/riv/idVysledku	RIV/00216224:14330/14:00073743
http://linked.open...riv/jazykVysledku	eng - angličtina
http://linked.open.../riv/klicovaSlova	Similarity Search; Metric Space; Approximation; Scalability (en)
http://linked.open.../riv/klicoveSlovo	Similarity Search Approximation Metric Space Scalability
http://linked.open...ontrolniKodProRIV	[BAE70DE506E7]
http://linked.open...v/mistoKonaniAkce	Munich, Germany
http://linked.open...i/riv/mistoVydani	Haidelberg
http://linked.open...i/riv/nazevZdroje	25th International Conference on Database and Expert Systems Applications (DEXA 2014 )
http://linked.open...in/vavai/riv/obor	JA
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
http://linked.open...UplatneniVysledku	2014
http://linked.open...iv/tvurceVysledku	Novák, David Zezula, Pavel
http://linked.open...vavai/riv/typAkce	WRD - Světová
http://linked.open.../riv/zahajeniAkce	2014-01-01 (xsd:date)
issn	0302-9743
number of pages	17 (xsd:int)
http://bibframe.org/vocab/doi	10.1007/978-3-319-10085-2_4
http://purl.org/ne...btex#hasPublisher	Springer International Publishing Switzerland
https://schema.org/isbn	9783319100845
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, 58 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software