About: Unified Framework for Fast Exact and Approximate Search in Dissimilarity Spaces

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

About: Unified Framework for Fast Exact and Approximate Search in Dissimilarity Spaces 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	Jednotný rámec pro rychlé přesné a aproximativní vyhledávání (cs) In multimedia systems we usually need to retrieve DB objects based on their similarity to a query object, while the similarity assessment is provided by a measure which defines a (dis)similarity score for every pair of DB objects. In most existing applications, the similarity measure is required to be a metric, where the triangle inequality is utilized to speedup the search for relevant objects by use of metric access methods (MAMs), e.g. the M-tree. A recent research has shown, however, that non-metric measures are more appropriate for similarity modeling due to their robustness and ease to model a made-to-measure similarity. Unfortunately, due to the lack of triangle inequality, the non-metric measures cannot be directly utilized by MAMs. From another point of view, some sophisticated similarity measures could be available in a black-box non-analytic form (e.g. as an algorithm or even a hardware device), where no information about their topological properties is provided, so we have to consider them In multimedia systems we usually need to retrieve DB objects based on their similarity to a query object, while the similarity assessment is provided by a measure which defines a (dis)similarity score for every pair of DB objects. In most existing applications, the similarity measure is required to be a metric, where the triangle inequality is utilized to speedup the search for relevant objects by use of metric access methods (MAMs), e.g. the M-tree. A recent research has shown, however, that non-metric measures are more appropriate for similarity modeling due to their robustness and ease to model a made-to-measure similarity. Unfortunately, due to the lack of triangle inequality, the non-metric measures cannot be directly utilized by MAMs. From another point of view, some sophisticated similarity measures could be available in a black-box non-analytic form (e.g. as an algorithm or even a hardware device), where no information about their topological properties is provided, so we have to consider them (en)
Title	Unified Framework for Fast Exact and Approximate Search in Dissimilarity Spaces Jednotný rámec pro rychlé přesné a aproximativní vyhledávání (cs) Unified Framework for Fast Exact and Approximate Search in Dissimilarity Spaces (en)
skos:prefLabel	Unified Framework for Fast Exact and Approximate Search in Dissimilarity Spaces Jednotný rámec pro rychlé přesné a aproximativní vyhledávání (cs) Unified Framework for Fast Exact and Approximate Search in Dissimilarity Spaces (en)
skos:notation	RIV/00216208:11320/07:00005172!RIV08-MSM-11320___
http://linked.open.../vavai/riv/strany	1;47
http://linked.open...avai/riv/aktivita	P Z
http://linked.open...avai/riv/aktivity	P(GP201/05/P036), Z(MSM0021620838)
http://linked.open...iv/cisloPeriodika	4
http://linked.open...vai/riv/dodaniDat	2008
http://linked.open...aciTvurceVysledku	Skopal, Tomáš
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	Univerzita Karlova v Praze / Matematicko-fyzikální fakulta
http://linked.open...dnocenehoVysledku	456613
http://linked.open...ai/riv/idVysledku	RIV/00216208:11320/07:00005172
http://linked.open...riv/jazykVysledku	eng - angličtina
http://linked.open.../riv/klicovaSlova	Unified; Framework; Exact; Approximate; Search; Dissimilarity; Spaces (en)
http://linked.open.../riv/klicoveSlovo	Approximate Framework Exact Search Dissimilarity Unified Spaces
http://linked.open...odStatuVydavatele	US - Spojené státy americké
http://linked.open...ontrolniKodProRIV	[D4C3373D0954]
http://linked.open...i/riv/nazevZdroje	ACM Transactions on Database Systems
http://linked.open...in/vavai/riv/obor	JC
http://linked.open...ichTvurcuVysledku	1 (xsd:int)
http://linked.open...cetTvurcuVysledku	1 (xsd:int)
http://linked.open...vavai/riv/projekt	Efficient metric search in large multimedia databases
http://linked.open...UplatneniVysledku	2007
http://linked.open...v/svazekPeriodika	32
http://linked.open...iv/tvurceVysledku	Skopal, Tomáš
http://linked.open...n/vavai/riv/zamer	Moderní metody, struktury a systémy informatiky
issn	0362-5915
number of pages	47 (xsd:int)
http://localhost/t...ganizacniJednotka	11320

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, 48 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software