메뉴 건너뛰기




Volumn 37, Issue 3, 2010, Pages

Time series motif discovery and anomaly detection based on subseries join

Author keywords

A1nomaly detection; Graphtheoretic algorithm; Motif discovery; Pattern recognition; Subseries join; Time series

Indexed keywords


EID: 77956520084     PISSN: 1819656X     EISSN: 18199224     Source Type: Journal    
DOI: None     Document Type: Article
Times cited : (12)

References (32)
  • 2
    • 54249086259 scopus 로고    scopus 로고
    • Efficiently Finding Unusual Shapes in Large Image Databases
    • L. Wei, E. Keogh, X. Yi, and M. Yoder, "Efficiently Finding Unusual Shapes in Large Image Databases," Data Mining and Knowledge Discovery, Vol. 17, No. 3, pp. 343-376, 2008.
    • (2008) Data Mining and Knowledge Discovery , vol.17 , Issue.3 , pp. 343-376
    • Wei, L.1    Keogh, E.2    Yi, X.3    Yoder, M.4
  • 8
    • 15544364892 scopus 로고    scopus 로고
    • Discovery of Time-series Motif from Multi-dimensional Data Based on MDL Principle
    • Y. Tanaka, K. Iwamoto, and K. Uehara, "Discovery of Time-series Motif from Multi-dimensional Data Based on MDL Principle," Machine Learning, Vol. 58, No. 2-3, pp. 269-300, 2005.
    • (2005) Machine Learning , vol.58 , Issue.2-3 , pp. 269-300
    • Tanaka, Y.1    Iwamoto, K.2    Uehara, K.3
  • 22
    • 0019887799 scopus 로고
    • Identification of Common Molecular Subsequences
    • T. F. Smith and M. S. Waterman, "Identification of Common Molecular Subsequences," Journal of Molecular Biology, Vol. 147, pp. 195-197, 1981.
    • (1981) Journal of Molecular Biology , vol.147 , pp. 195-197
    • Smith, T.F.1    Waterman, M.S.2
  • 23
    • 0004392821 scopus 로고
    • The Enumeration of Maximal Cliques of Large Graphs
    • E. A. Akkoyunlu, "The Enumeration of Maximal Cliques of Large Graphs," SIAM Journal on Computing, Vol. 2, pp. 1-6, 1973.
    • (1973) SIAM Journal on Computing , vol.2 , pp. 1-6
    • Akkoyunlu, E.A.1
  • 25
    • 85030546698 scopus 로고
    • A Fast Parallel Algorithm for Computing All Maximal Cliques in a Graph and the Related Problems
    • Springer-Verlag, London, UK, ISBN:3-540-19487-8
    • E. Dahlhaus and M. Karpinski, "A Fast Parallel Algorithm for Computing All Maximal Cliques in a Graph and the Related Problems," The 1st Scandinavian Workshop on Algorithm Theory (SWAT'88), Springer-Verlag, London, UK, No. 318, pp. 139-144, ISBN:3-540-19487-8, 1988.
    • (1988) The 1st Scandinavian Workshop on Algorithm Theory (SWAT'88) , Issue.318 , pp. 139-144
    • Dahlhaus, E.1    Karpinski, M.2
  • 30
    • 84867474446 scopus 로고    scopus 로고
    • Economagic.com, Stock Price Indicies
    • Economagic.com, Stock Price Indicies, http://www.economagic.com/sp.htm.
  • 32
    • 84867470521 scopus 로고    scopus 로고
    • Carnegie-Mellon MoCap Database, Graphics Lab, Carnegie-Mellon University
    • Carnegie-Mellon MoCap Database, Graphics Lab, Carnegie-Mellon University, http://mocap.cs.cmu.edu.


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.