Další formáty:
BibTeX
LaTeX
RIS
@inproceedings{990741,
author = {Novák, David and Volný, Petr and Zezula, Pavel},
address = {Berlin / Heidelberg},
booktitle = {Database and Expert Systems Applications},
doi = {http://dx.doi.org/10.1007/978-3-642-32597-7_23},
editor = {Liddle, Stephen and Schewe, Klaus-Dieter and Tjoa, A and Zhou, Xiaofang},
keywords = {subsequence matching; metric indexing; framework},
howpublished = {tištěná verze "print"},
language = {eng},
location = {Berlin / Heidelberg},
isbn = {978-3-642-32596-0},
pages = {256-265},
publisher = {Springer},
title = {Generic Subsequence Matching Framework: Modularity, Flexibility, Efficiency},
url = {http://www.springerlink.com/content/m465x3505v33w465/},
year = {2012}
}
TY - JOUR
ID - 990741
AU - Novák, David - Volný, Petr - Zezula, Pavel
PY - 2012
TI - Generic Subsequence Matching Framework: Modularity, Flexibility, Efficiency
PB - Springer
CY - Berlin / Heidelberg
SN - 9783642325960
KW - subsequence matching
KW - metric indexing
KW - framework
UR - http://www.springerlink.com/content/m465x3505v33w465/
L2 - http://www.springerlink.com/content/m465x3505v33w465/
N2 - 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. The strictly modular architecture and openness of SMF enables also involvement of efficient solutions from different fields, for instance advanced metric-based indexes.
ER -
NOVÁK, David, Petr VOLNÝ a Pavel ZEZULA. Generic Subsequence Matching Framework: Modularity, Flexibility, Efficiency. In Liddle, Stephen and Schewe, Klaus-Dieter and Tjoa, A and Zhou, Xiaofang. \textit{Database and Expert Systems Applications}. Berlin / Heidelberg: Springer. s.~256-265. ISBN~978-3-642-32596-0. doi:10.1007/978-3-642-32597-7\_{}23. 2012.
|
