Locating motifs in time-series data

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

Volumn 3518 LNAI, Issue , 2005, Pages 343-353

  Liu, Zheng ^a   Yu, Jeffrey Xu ^b   Lin, Xuemin ^a   Lu, Hongjun ^c   Wang, Wei ^a  

^a UNIVERSITY OF NEW SOUTH WALES   (Australia)

^b CHINESE UNIVERSITY OF HONG KONG   (Hong Kong)

^c HONG KONG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Hong Kong)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DATABASE SYSTEMS; HEURISTIC METHODS; NUMERICAL ANALYSIS; TIME SERIES ANALYSIS;

MOTIFS; TIME-SERIES DATA;

DATA MINING;

EID: 26944493027     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11430919_41     Document Type: Conference Paper

References (9)

1. C. Bron and J. Kerbosch. Algorithm 457: finding all cliques of an undirected graph. Communications of the ACM, 16(9):575-577, 1973.
2. B. Chiu, E. Keogh, and S. Lonardi. Probabilistic discovery of time series motifs. In Proc. of KDD'03, 2003.
3. B. Gärtner. Fast and robust smallest enclosing balls. In Proc. of ESA'99, 1999.
4. J. Han and M. Kamber. Data Mining: Concepts and Techniques. 2001.
5. A. Hinnerburg and D. A. Keim. Optimal grid-clustering: Towards breaking the curse of dimensionality in high-dimensional clustering. In Proc. of VLDB'99, 1999.
6. E. Keogh, J. Lin, and W. Truppel. Clustering of time series subsequences is meaningless: Implications for past and future research. In Proc. of ICDM'03, 2003.
7. J. Lin, E. Keogh, S. Lonardi, and P. Patel. Finding motifs in time series. In Proc. of the 2nd Workshop on Temporal Data Mining, at ACM SIGKDD'02, 2002.
8. P. Patel, E. Keogh, J. Lin, and S. Lonardi. Mining motifs in massive time series database. In Proc. of ICDM'02, 2002.
9. E. Welzl. Smallest enclosing disks (balls and ellipsoids). In New Results and New Trends in Computer Science. Springer-Verlag, 1991.