메뉴 건너뛰기




Volumn 38, Issue 12, 2004, Pages 1566-1569

Variable step algorithm for sub-trend sequence searching

Author keywords

Data mining; Sub sequence search; Trend sequence

Indexed keywords

COMPUTER SIMULATION; LEARNING ALGORITHMS; NUMERICAL ANALYSIS; TIME SERIES ANALYSIS;

EID: 13644273612     PISSN: 1008973X     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article
Times cited : (6)

References (8)
  • 5
    • 0346012989 scopus 로고    scopus 로고
    • A faster algorithm for approximate string matching
    • New York: Spirnger
    • BAEZA-Yates R, NAVARRO G. A faster algorithm for approximate string matching [A]. Proceedings of CPM' 96 [C]. New York: Spirnger, 1996: 1-23.
    • (1996) Proceedings of CPM'96 , pp. 1-23
    • Baeza-Yates, R.1    Navarro, G.2
  • 6
    • 0000444709 scopus 로고    scopus 로고
    • A practical index for text retrieval allowing errors
    • BAEZA-YATES R, NAVARRO G. A practical index for text retrieval allowing errors [J]. CLEI, 1997, 1: 273-282.
    • (1997) CLEI , Issue.1 , pp. 273-282
    • Baeza-Yates, R.1    Navarro, G.2
  • 7
    • 13644273827 scopus 로고    scopus 로고
    • Fast algorithm for mining similar sub-trend sequence in time-series databases
    • GUO Si-yu WU Tie-jun. Fast algorithm for mining similar sub-trend sequence in time-series databases [J]. Journal of Zhejiang University: Engineering Science, 2002, 36(4): 421-426.
    • (2002) Journal of Zhejiang University: Engineering Science , vol.36 , Issue.4 , pp. 421-426
    • Guo, S.-Y.1    Wu, T.-J.2


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