Mining Approximate Motifs in Time Series

  • Pedro G. Ferreira
  • Paulo J. Azevedo
  • Cândida G. Silva
  • Rui M. M. Brito
Conference paper

DOI: 10.1007/11893318_12

Volume 4265 of the book series Lecture Notes in Computer Science (LNCS)
Cite this paper as:
Ferreira P.G., Azevedo P.J., Silva C.G., Brito R.M.M. (2006) Mining Approximate Motifs in Time Series. In: Todorovski L., Lavrač N., Jantke K.P. (eds) Discovery Science. DS 2006. Lecture Notes in Computer Science, vol 4265. Springer, Berlin, Heidelberg

Abstract

The problem of discovering previously unknown frequent patterns in time series, also called motifs, has been recently introduced. A motif is a subseries pattern that appears a significant number of times. Results demonstrate that motifs may provide valuable insights about the data and have a wide range of applications in data mining tasks. The main motivation for this study was the need to mine time series data from protein folding/unfolding simulations. We propose an algorithm that extracts approximate motifs, i.e. motifs that capture portions of time series with a similar and eventually symmetric behavior. Preliminary results on the analysis of protein unfolding data support this proposal as a valuable tool. Additional experiments demonstrate that the application of utility of our algorithm is not limited to this particular problem. Rather it can be an interesting tool to be applied in many real world problems.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Pedro G. Ferreira
    • 1
  • Paulo J. Azevedo
    • 1
  • Cândida G. Silva
    • 2
  • Rui M. M. Brito
    • 2
  1. 1.Department of InformaticsUniversity of MinhoBragaPortugal
  2. 2.Chemistry Department, Faculty of Sciences and Technology, and Centre of Neurosciences of CoimbraUniversity of CoimbraCoimbraPortugal