Generic Subsequence Matching Framework: Modularity, Flexibility, Efficiency

  • David Novak
  • Petr Volny
  • Pavel Zezula
Conference paper

DOI: 10.1007/978-3-642-32597-7_23

Part of the Lecture Notes in Computer Science book series (LNCS, volume 7447)
Cite this paper as:
Novak D., Volny P., Zezula P. (2012) Generic Subsequence Matching Framework: Modularity, Flexibility, Efficiency. In: Liddle S.W., Schewe KD., Tjoa A.M., Zhou X. (eds) Database and Expert Systems Applications. DEXA 2012. Lecture Notes in Computer Science, vol 7447. Springer, Berlin, Heidelberg

Abstract

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • David Novak
    • 1
  • Petr Volny
    • 1
  • Pavel Zezula
    • 1
  1. 1.Masaryk UniversityBrnoCzech Republic

Personalised recommendations