Generic Subsequence Matching Framework: Modularity, Flexibility, Efficiency

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216224%3A14330%2F12%3A00073385" target="_blank" >RIV/00216224:14330/12:00073385 - isvavai.cz</a>

Výsledek na webu

<a href="http://www.springerlink.com/content/m465x3505v33w465/" target="_blank" >http://www.springerlink.com/content/m465x3505v33w465/</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1007/978-3-642-32597-7_23" target="_blank" >10.1007/978-3-642-32597-7_23</a>

Jazyk výsledku

angličtina

Název v původním jazyce

Generic Subsequence Matching Framework: Modularity, Flexibility, Efficiency

Popis výsledku v původním jazyce

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 fora 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 an

Název v anglickém jazyce

Generic Subsequence Matching Framework: Modularity, Flexibility, Efficiency

Popis výsledku anglicky

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 fora 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 an

Druh

D - Stať ve sborníku

CEP obor

IN - Informatika

OECD FORD obor

—

Projekt

Výsledek vznikl pri realizaci vícero projektů. Více informací v záložce Projekty.

Návaznosti

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Rok uplatnění

2012

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název statě ve sborníku

Database and Expert Systems Applications

ISBN

9783642325960

ISSN

0302-9743

e-ISSN

—

Počet stran výsledku

10

Strana od-do

256-265

Název nakladatele

Springer

Místo vydání

Berlin / Heidelberg

Místo konání akce

Vienna

Datum konání akce

1. 1. 2012

Typ akce podle státní příslušnosti

WRD - Celosvětová akce

Kód UT WoS článku

—