Mining approximate motifs in time series

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4265 LNAI, Issue , 2006, Pages 89-101

  Ferreira, Pedro G ^a   Azevedo, Paulo J ^a   Silva, Cândida G ^b   Brito, Rui M M ^b  

^a UNIVERSITY OF MINHO   (Portugal)

^b UNIVERSITY OF COIMBRA   (Portugal)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; COMPUTER SCIENCE; COMPUTER SIMULATION; DATA MINING; PROBLEM SOLVING;

MINING APPROXIMATE MOTIFS; PROTEIN FOLDING; SUBSERIES PATTERNS; UNFOLDING SIMULATIONS;

TIME SERIES ANALYSIS;

EID: 33750736111     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11893318_12     Document Type: Conference Paper

References (20)

1. P. Azevedo, C. Silva, J. Rodrigues, N. Loureiro-Ferreira, and R. Brito. Detection of Hydrophobic clusters in molecular dynamics protein unfolding simulations using association rules. LNCS, (3745), 2005.
2. T. Bailey and C. Elkan. Fitting a mixture model by expectation maximization to discover motifs in biopolymers. In Proc. of the 2th ISMB, 1994.
3. R. Brito, W. Dubitzky, and J. Rodrigues. Protein folding and unfolding simulations: A new challenge for data mining. OMICS: A Journal of Integrative Biology, (8):153-166, 2004.
4. J. Caraca-Valente and I.Lopez-Chavarrias, Discovering similar patterns in time series. In Proc. of the 6th ACM SIGKDD, 2000.
5. B. Chiu, E. Keogh, and S. Lonardi, Probablistic discovery of time series motifs. In Proceedings of the 9th ACM SIGKDD, Washington DC, USA, August 24-27 2003.
6. D. Gunopulos and G. Das. Time series similarity measures (tutorial pm-2). In Tutorial notes of the 6th ACM SIGKDD, 2000.
7. J. Han, G. Dong, and Y. Yin. Efficient mining of partial periodic patterns in time series database. In Proc. of the 15th ICDE, 1999.
8. S. Hettich and S. D. Bay. The uci kdd archive irvine,[http://kdd.ics.uci. edu], ca: University of California, department of information and computer science, 1999.
9. E. Keogh and S. Kasetty. On the need for time series data mining benchmarks: A survey and empricial demonstration. In Proc. of the 8th ACM SIGKDD, 2002.
10. E. Keogh, J. Lin, and A. Fu. Hot sax: Efficiently finding the most unusual time series subsequence. In Proc. of the 5th IEEE ICDM, 2005.
11. E. Keogh and M. Pazzani. Scaling up dynamic time warping for datamining applications. In Proc. of the 6th ACM SIGKDD, 2000.
12. Anders Krogh. An Introduction to Hidden Markov Models for Biological Sequences, chapter 4, pages 45-63. Elsevier, 1998.
13. H. Lei and V. Govindaraju. Grm: A new model for clustering linear sequences. In Proc. of SIAM Int'l Conference on Data Mining, 2004.
14. J. Lin, E. Keogh, S. Lonardi, and B. Chiu. A symbolic representation of time series, with implications for streaming algorithms. In Proc. of the 8th ACM SIGMOD workshop DMKD'03, 2003.
15. H. Mannila, H. Toivonen, and A. Verkamo. Discovery of frequent episodes in event sequences. Data Mining and Knowledge Discovery, 1(3):259-289, 1997.
16. P. Patel, E.Keogh, J.Lin, and S.Lonardi. Mining motifs in massive time series databases. In Proc. of 2th IEEE ICDM, December 2002.
17. Y. Tanaka and K. Uehara. Discover motifs in multi-dimensional time-series using the principal component analysis and the mdl principle. In Proc. of 3th MLDM, 2003.
18. W. Thompson, E. Rouchka, and C. Lawrence. Gibbs recursive sampler: finding transcription factor binding sites. Nucleic Acids Research, 31(13):3580-3585, 2003.
19. J. Yang and P.S. Yu W. Wang. Mining surprising periodic patterns. In Proc. of the 7th ACM SIGKDD, 2001.
20. J.H. Zar. Biostatistical Analysis (4th Edition). Prentice Hall, 1998.