Generic Subsequence Matching Framework: Modularity, Flexibility, Efficiency
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216224%3A14330%2F12%3A00057555" target="_blank" >RIV/00216224:14330/12:00057555 - isvavai.cz</a>
Result on the web
<a href="http://arxiv.org/abs/1206.2510v1" target="_blank" >http://arxiv.org/abs/1206.2510v1</a>
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Generic Subsequence Matching Framework: Modularity, Flexibility, Efficiency
Original language 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 mentionthe implementation bias that makes difficult a proper comparison of competing approaches.
Czech name
—
Czech description
—
Classification
Type
O - Miscellaneous
CEP classification
IN - Informatics
OECD FORD branch
—
Result continuities
Project
Result was created during the realization of more than one project. More information in the Projects tab.
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)
Others
Publication year
2012
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů