About: Towards Efficient Indexing of Arbitrary Similarity

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

About: Towards Efficient Indexing of Arbitrary Similarity 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://www.sigmod.org/publications/sigmod-record/1306/pdfs/03.articles.bartos.pdf
Description	The popularity of similarity search expanded with the increased interest in multimedia databases, bioinformatics, or social networks, and with the growing number of users trying to find information in huge collections of unstructured data. During the exploration, the users handle database objects in different ways based on the utilized similarity models, ranging from simple to complex models. Efficient indexing techniques for similarity search are required especially for growing databases. In this paper, we study implementation possibilities of the recently announced theoretical framework SIMDEX, the task of which is to algorithmically explore a given similarity space and find possibilities for efficient indexing. Instead of a fixed set of indexing properties, such as metric space axioms, SIMDEX aims to seek for alternative properties that are valid in a particular similarity model (database) and, at the same time, provide efficient indexing. In particular, we propose to implement the fundamental parts of SIMDEX by means of the genetic programming (GP) which we expect will provide high-quality resulting set of expressions (axioms) useful for indexing. The popularity of similarity search expanded with the increased interest in multimedia databases, bioinformatics, or social networks, and with the growing number of users trying to find information in huge collections of unstructured data. During the exploration, the users handle database objects in different ways based on the utilized similarity models, ranging from simple to complex models. Efficient indexing techniques for similarity search are required especially for growing databases. In this paper, we study implementation possibilities of the recently announced theoretical framework SIMDEX, the task of which is to algorithmically explore a given similarity space and find possibilities for efficient indexing. Instead of a fixed set of indexing properties, such as metric space axioms, SIMDEX aims to seek for alternative properties that are valid in a particular similarity model (database) and, at the same time, provide efficient indexing. In particular, we propose to implement the fundamental parts of SIMDEX by means of the genetic programming (GP) which we expect will provide high-quality resulting set of expressions (axioms) useful for indexing. (en)
Title	Towards Efficient Indexing of Arbitrary Similarity Towards Efficient Indexing of Arbitrary Similarity (en)
skos:prefLabel	Towards Efficient Indexing of Arbitrary Similarity Towards Efficient Indexing of Arbitrary Similarity (en)
skos:notation	RIV/00216208:11320/13:10139516!RIV14-GA0-11320___
http://linked.open...avai/riv/aktivita	P S
http://linked.open...avai/riv/aktivity	P(GAP202/11/0968), S
http://linked.open...iv/cisloPeriodika	2
http://linked.open...vai/riv/dodaniDat	2014
http://linked.open...aciTvurceVysledku	Skopal, Tomáš Moško, Juraj Bartoš, 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	111372
http://linked.open...ai/riv/idVysledku	RIV/00216208:11320/13:10139516
http://linked.open...riv/jazykVysledku	eng - angličtina
http://linked.open.../riv/klicovaSlova	genetic programming; exploration; similarity serach; indexing (en)
http://linked.open.../riv/klicoveSlovo	indexing exploration similarity serach genetic programming
http://linked.open...odStatuVydavatele	US - Spojené státy americké
http://linked.open...ontrolniKodProRIV	[E7A23741BD90]
http://linked.open...i/riv/nazevZdroje	SIGMOD Record
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	Large-scale Nonmetric Similarity Search in Complex Domains
http://linked.open...UplatneniVysledku	2013
http://linked.open...v/svazekPeriodika	42
http://linked.open...iv/tvurceVysledku	Moško, Juraj Skopal, Tomáš Bartoš, Tomáš
http://linked.open...ain/vavai/riv/wos	000321322500001
issn	0163-5808
number of pages	6 (xsd:int)
http://bibframe.org/vocab/doi	10.1145/2503792.2503794
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, 58 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software