메뉴 건너뛰기




Volumn , Issue , 2003, Pages 481-484

Efficient subsequence matching in time series databases under time and amplitude transformations

Author keywords

[No Author keywords available]

Indexed keywords


EID: 33748123736     PISSN: 15504786     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (24)

References (17)
  • 3
    • 0032638572 scopus 로고    scopus 로고
    • Fast time-series searching with scaling and shifting
    • Philadelphia, PA
    • K. Chu and M. Wong. Fast time-series searching with scaling and shifting. In Proceedings of ACM Principles on Database Systems, pages 237-248, Philadelphia, PA, 1999.
    • (1999) Proceedings of ACM Principles on Database Systems , pp. 237-248
    • Chu, K.1    Wong, M.2
  • 12
    • 84942742938 scopus 로고    scopus 로고
    • A simple dimensionality reduction technique for fast similarity search in large time series databases
    • Kyoto, Japan
    • E. Keogh and M. Pazzani. A simple dimensionality reduction technique for fast similarity search in large time series databases. In Proceedings of 4th Pacific- Asia Conf. on Knowledge Discovery and Data Mining, pages 122-133, Kyoto, Japan, 2000.
    • (2000) Proceedings of 4th Pacific- Asia Conf. on Knowledge Discovery and Data Mining , pp. 122-133
    • Keogh, E.1    Pazzani, M.2
  • 16
    • 0033871047 scopus 로고    scopus 로고
    • Landmarks: A new model for similarity-based pattern querying in time series databases
    • San Diego, CA
    • C. Perng, H. Wang, S. Zhang, and S. Parker. Landmarks: a new model for similarity-based pattern querying in time series databases. In Proceedings of 16th Int'l Conf. on Data Engineering, pages 33-42, San Diego, CA, 2000.
    • (2000) Proceedings of 16th Int'l Conf. on Data Engineering , pp. 33-42
    • Perng, C.1    Wang, H.2    Zhang, S.3    Parker, S.4


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