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://www.springerlink.com/content/m465x3505v33w465/
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 solutions is so wide that their proper comparison and combination suitable for a particular task might be very complicated and time-consuming. In this work, we present a new generic Subsequence Matching Framework (SMF) that tries to overcome the aforementioned problem by a uniform frame that simplifies and speeds up the design, development and evaluation of subsequence matching related systems. We identify several relatively separate subtasks solved differently over the literature and SMF enables to combine them in a straightforward manner achieving new quality and efficiency. 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 solutions is so wide that their proper comparison and combination suitable for a particular task might be very complicated and time-consuming. In this work, we present a new generic Subsequence Matching Framework (SMF) that tries to overcome the aforementioned problem by a uniform frame that simplifies and speeds up the design, development and evaluation of subsequence matching related systems. We identify several relatively separate subtasks solved differently over the literature and SMF enables to combine them in a straightforward manner achieving new quality and efficiency. (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:00073385!RIV15-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	2015
http://linked.open...aciTvurceVysledku	Zezula, Pavel Novák, David Volný, Petr
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	137878
http://linked.open...ai/riv/idVysledku	RIV/00216224:14330/12:00073385
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	[5C32B046D56C]
http://linked.open...v/mistoKonaniAkce	Vienna
http://linked.open...i/riv/mistoVydani	Berlin / Heidelberg
http://linked.open...i/riv/nazevZdroje	Database and Expert Systems Applications
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://linked.open...vavai/riv/typAkce	WRD - Světová
http://linked.open.../riv/zahajeniAkce	2012-01-01 (xsd:date)
issn	0302-9743
number of pages	10 (xsd:int)
http://bibframe.org/vocab/doi	10.1007/978-3-642-32597-7_23
http://purl.org/ne...btex#hasPublisher	Springer-Verlag
https://schema.org/isbn	9783642325960
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