About: Designing Similarity Indexes with Parallel Genetic Programming

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

About: Designing Similarity Indexes with Parallel Genetic Programming 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://link.springer.com/chapter/10.1007/978-3-642-41062-8_29
Description	The increasing diversity of unstructured databases leads to the development of advanced indexing techniques as the metric indexing model does not fit to the general similarity models. Once the most critical postulate, namely the triangle inequality, does not hold, the metric model produces notable errors during the query evaluation. To overcome this situation and to obtain more qualitative results, we want to discover better indexing models for databases using arbitrary similarity measures. However, each database is unique in a specific way, so we outline the automatic way of exploring the best indexing method. We introduce the exploration approach using parallel genetic programming principles in a multi-threaded environment built upon recently introduced SIMDEX Framework. Furthermore, we introduce \emph{smart pivot table} which is an intelligent indexing method capable of incorporating obtained results. We supplement the theoretical background with experiments showing the achieved improvements in comparison to the single-threaded evaluations. The increasing diversity of unstructured databases leads to the development of advanced indexing techniques as the metric indexing model does not fit to the general similarity models. Once the most critical postulate, namely the triangle inequality, does not hold, the metric model produces notable errors during the query evaluation. To overcome this situation and to obtain more qualitative results, we want to discover better indexing models for databases using arbitrary similarity measures. However, each database is unique in a specific way, so we outline the automatic way of exploring the best indexing method. We introduce the exploration approach using parallel genetic programming principles in a multi-threaded environment built upon recently introduced SIMDEX Framework. Furthermore, we introduce \emph{smart pivot table} which is an intelligent indexing method capable of incorporating obtained results. We supplement the theoretical background with experiments showing the achieved improvements in comparison to the single-threaded evaluations. (en)
Title	Designing Similarity Indexes with Parallel Genetic Programming Designing Similarity Indexes with Parallel Genetic Programming (en)
skos:prefLabel	Designing Similarity Indexes with Parallel Genetic Programming Designing Similarity Indexes with Parallel Genetic Programming (en)
skos:notation	RIV/00216208:11320/13:10194786!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...vai/riv/dodaniDat	2014
http://linked.open...aciTvurceVysledku	Skopal, Tomáš Bartoš, Tomáš
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	Univerzita Karlova v Praze / Matematicko-fyzikální fakulta
http://linked.open...dnocenehoVysledku	68680
http://linked.open...ai/riv/idVysledku	RIV/00216208:11320/13:10194786
http://linked.open...riv/jazykVysledku	eng - angličtina
http://linked.open.../riv/klicovaSlova	exploration; genetic programming; similarity search (en)
http://linked.open.../riv/klicoveSlovo	similarity search exploration genetic programming
http://linked.open...ontrolniKodProRIV	[99A07DCB33E0]
http://linked.open...v/mistoKonaniAkce	A Coruña, Spain
http://linked.open...i/riv/mistoVydani	Springer Berlin Heidelberg
http://linked.open...i/riv/nazevZdroje	Lecture Notes in Computer Science
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	Large-scale Nonmetric Similarity Search in Complex Domains
http://linked.open...UplatneniVysledku	2013
http://linked.open...iv/tvurceVysledku	Skopal, Tomáš Bartoš, Tomáš
http://linked.open...vavai/riv/typAkce	WRD - Světová
http://linked.open.../riv/zahajeniAkce	2013-10-02 (xsd:date)
issn	0302-9743
number of pages	6 (xsd:int)
http://bibframe.org/vocab/doi	10.1007/978-3-642-41062-8_29
http://purl.org/ne...btex#hasPublisher	Springer-Verlag. (Berlin; Heidelberg)
https://schema.org/isbn	978-3-642-41061-1
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