Discovering representative models in large time series databases

Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science)

Volumn 3055, Issue , 2004, Pages 84-97

  Rombo, Simona ^a   Terracina, Giorgio ^b  

^a UNIVERSITY MEDITERRANEA OF REGGIO CALABRIA   (Italy)

^b UNIVERSITY OF CALABRIA   (Italy)

Author keywords

Frequent Pattern Discovery.; Time Series

Indexed keywords

COMPUTATIONAL COMPLEXITY; DATA MINING; DIAGNOSIS; ELECTROCARDIOGRAPHY; ELECTROENCEPHALOGRAPHY; KNOWLEDGE REPRESENTATION; MATHEMATICAL MODELS; MEDICAL APPLICATIONS; PATTERN RECOGNITION; PRINCIPAL COMPONENT ANALYSIS; TIME SERIES ANALYSIS;

ASSOCIATION RULE DISCOVERY; FREQUENT PATTERN DISCOVERY; REPRESENTATIVE MODELS; TIME SERIES DATABASES;

DATABASE SYSTEMS; TIME SERIES;

APPLICATION CONTEXTS; ASSOCIATION RULE DISCOVERY; DATA MINING TASKS; DISCRETIZATIONS; EXPERIMENTAL TEST; FREQUENT PATTERN DISCOVERY; LARGE TIME SERIES DATABASE; MATCHING PATTERNS;

EID: 9444244530     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-25957-2_8     Document Type: Conference Paper

References (21)

1. R. Agrawal, C. Faloutsos, and A. Swami. Efficient similarity search in sequence databases. In Proc. of the 4th International Conference on Foundations of Data Organization and Algorithms, pages 69-84, Chicago, IL, 1993.
2. R. Agrawal, K.I. Lin, H.S. Sawhney, and K. Shim. Fast similarity search in the presence of noise, scaling, and translation in time-series databases. In Proc. of the Twenty-First International Conference on Very Large Data Bases, pages 490-501, Zurich, Switzerland, 1995. Morgan Kaufmann.
3. H. Andre-Jonsson and D. Badal. Using signature files for querying time-series data. In Proc. of the 1st European Symposium on Principle of Data Mining and Knowledge Discovery, pages 211-220, Trondheim, Norway, 1997.
4. C. Berberidis, I. Vlahavas, W.G. Aref, M. Atallah, and A.K. Elmagarmid. On the discovery of weak periodicities in large time series. In Proceedings of the 6th Pacific-Asia Conference on Advances in Knowledge Discovery and Data Mining (PAKDD 2002), pages 51-61, Taipei, Taiwan, 2002.
5. A. Brazma, I. Jonassen, I. Eidhammer, and D. Gilbert. Approaches to the automatic discovery of patterns in biosequences. Journal of Computational Biology, 5(2):277-304, 1998.
6. W.A. Burkhard and R.M. Keller. Some approaches to best-match file searching. Communications of the ACM, 16(4):230-236, 1973.
7. K. Chan and A.W. Fu. Efficient time series matching by wavelets. In Proc. of the 15th IEEE International Conference on Data Engineering (ICDE'99), pages 126-133, Sydney, Australia, 1999. IEEE Computer Society Press.
8. G. Das, K. Lin, H. Mannila, G. Renganathan, and P. Smyth. Rule discovery from time series. In Proc. of 4th International Conference on Knowledge Discovery and Data Mining, pages 16-22, New York, 1998. ACM Press.
9. U.M. Fayyad, C. Reina, and P.S. Bradley. Initialization of iterative refinement clustering algorithms. In Proc. of 4th International Conference on Knowledge Discovery and Data Mining, pages 194-198, New York, 1998. ACM Press.
10. X. Ge and P. Smyth. Deformable markov model templates for time-series pattern matching. In Proc. of the 6th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pages 81-90, Boston, MA, 2000.
11. D. Gusfield. Algorithms on Strings, Trees and Sequences: Computer Science and Computational Biology. Cambrige University Press, 1997.
12. A. Guttman. R-trees: a dynamic index structure for spatial searching. In ACM SIGMOD, pages 47-57, Boston, Massachusetts, 1984.
13. F. Höppner. Discovery of temporal patterns-learning rules about the qualitative behaviour of time series. In Proc. of the 5th European Conference on Principles and Practice of Knowledge Discovery in Databases, pages 192-203, Freiburg, Germany, 2001.
14. K. Kalpakis, D. Gada, and V. Puttagunta. Distance measures for effective clustering of ARIMA time-series. In Proc. of the 2001 IEEE International Conference on Data Mining, pages 273-380, San Jose, CA, 2001.
15. E.J. Keogh, K. Chakrabarti, M.J. Pazzani, and S. Mehrotra. Dimensionality reduction for fast similarity search in large time series databases. Journal of Knowledge and Information Systems, 3(3):263-286, 2001.
16. E.J. Keogh and M. Pazzani. An enhanced representation of time series which allows fast and accurate classification, clustering and relevance feedback. In Proc. of 4th International Conference on Knowledge Discovery and Data Mining, pages 239-241, New York City, NY, 1998. ACM Press.
17. P. Patel, E.Keogh, J.Lin, and S.Lonardi. Mining motifs in massive time series databases. In Proceedings of IEEE International Conference on Data Mining, pages 370-377, Maebashi City, Japan, December 2002.
18. D. Shasha and T. Wang. New techniques for best-match retrieval. ACM Transaction on Information Systems, 8(2):140-158, 1990.
19. Y. Tanaka and K. Uehara. Discover motifs in multi-dimensional time-series using the principal component analysis and the mdl principle. In Prooc. of the Third International Conference on Machine Learning and Data Mining in Pattern Recognition (MLDM 2003), pages 252-265, Leipzig, Germany, 2003. Lecture Notes in Computer Science, Springer Verlag.
20. B.K. Yi and C. Faloutos. Fast time sequence indexing for arbitrary lp norms. In Proceedings of the 26th International Conference on Very Large Databases, pages 385-394, Cairo, Egypt, 2000.
21. J. Xu Yu, M.K. Ng, and J. Zhexur Huang. Patterns discovery based on timeseries decomposition. In Proceedings of the 5th Pacific-Asia Conference on Advances in Knowledge Discovery and Data Mining (PAKDD 2001), pages 336-347, Hong Kong, China, 2001.