About: Generic Subsequence Matching Framework: Modularity, Flexibility, Efficiency

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

About: Generic Subsequence Matching Framework: Modularity, Flexibility, Efficiency 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://arxiv.org/abs/1206.2510v1
Description	Subsequence matching has appeared to be an ideal approach for solving many problems related to the fields of data mining and similarity retrieval. It has been shown that almost any data class (audio, image, biometrics, signals) is or can be represented by some kind of time series or string of symbols, which can be seen as an input for various subsequence matching approaches. The variety of data types, specific tasks and their partial or full solutions is so wide that the choice, implementation and parametrization of a suitable solution for a given task might be complicated and time-consuming; a possibly fruitful combination of fragments from different research areas may not be obvious nor easy to realize. The leading authors of this field also mention the implementation bias that makes difficult a proper comparison of competing approaches. Subsequence matching has appeared to be an ideal approach for solving many problems related to the fields of data mining and similarity retrieval. It has been shown that almost any data class (audio, image, biometrics, signals) is or can be represented by some kind of time series or string of symbols, which can be seen as an input for various subsequence matching approaches. The variety of data types, specific tasks and their partial or full solutions is so wide that the choice, implementation and parametrization of a suitable solution for a given task might be complicated and time-consuming; a possibly fruitful combination of fragments from different research areas may not be obvious nor easy to realize. The leading authors of this field also mention the implementation bias that makes difficult a proper comparison of competing approaches. (en)
Title	Generic Subsequence Matching Framework: Modularity, Flexibility, Efficiency Generic Subsequence Matching Framework: Modularity, Flexibility, Efficiency (en)
skos:prefLabel	Generic Subsequence Matching Framework: Modularity, Flexibility, Efficiency Generic Subsequence Matching Framework: Modularity, Flexibility, Efficiency (en)
skos:notation	RIV/00216224:14330/12:00057555!RIV13-GA0-14330___
http://linked.open...avai/riv/aktivita	P
http://linked.open...avai/riv/aktivity	P(GAP103/10/0886), P(GPP202/10/P220)
http://linked.open...vai/riv/dodaniDat	2013
http://linked.open...aciTvurceVysledku	Zezula, Pavel Novák, David Volný, Petr
http://linked.open.../riv/druhVysledku	O - Ostatní výsledky nezařaditelné do žádného z výše uvedených druhů výsledku
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	137879
http://linked.open...ai/riv/idVysledku	RIV/00216224:14330/12:00057555
http://linked.open...riv/jazykVysledku	eng - angličtina
http://linked.open.../riv/klicovaSlova	subsequence matching; metric indexing; framework (en)
http://linked.open.../riv/klicoveSlovo	subsequence matching framework metric indexing
http://linked.open...ontrolniKodProRIV	[61CE7D0848D1]
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	Content-based Image Retrieval on the Web Scale Efficient Similarity Search with Constant Scalability
http://linked.open...UplatneniVysledku	2012
http://linked.open...iv/tvurceVysledku	Novák, David Volný, Petr Zezula, Pavel
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, 100 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software