메뉴 건너뛰기




Volumn 06-10-September-2004, Issue , 2015, Pages 1605-1608

Similarity measure for heterogeneous multivariate time-series

Author keywords

[No Author keywords available]

Indexed keywords

DECISION MAKING; TIME SERIES;

EID: 84979955522     PISSN: 22195491     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (7)

References (9)
  • 2
    • 0013236534 scopus 로고    scopus 로고
    • String editing and longest common subsequence
    • G. Rozenberg and A. Salomaa, editors,Berlin,Springer Verlag
    • A. Apostolico, "String editing and longest common subsequence, " G. Rozenberg and A. Salomaa, editors, Handbook of Formal Languages, vol. 2, pp. 36 1-398, Berlin, 1997. Springer Verlag.
    • (1997) Handbook of Formal Languages , vol.2 , pp. 361-398
    • Apostolico, A.1
  • 5
    • 84976825385 scopus 로고
    • Algorithms for the longest common subsequence problem
    • D. S. Hirschberg, "Algorithms for the longest common subsequence problem, " JACM, vol. 24 (4), pp. 664-675, 1977.
    • (1977) JACM , vol.24 , Issue.4 , pp. 664-675
    • Hirschberg, D.S.1
  • 6
    • 0017492836 scopus 로고
    • A fast algorithm for computing longest common subsequences
    • J. W. Hunt & T. G. Szymanski, "A fast algorithm for computing longest common subsequences, " CACM, vol. 20 (5), pp. 350-353, 1977.
    • (1977) CACM , vol.20 , Issue.5 , pp. 350-353
    • Hunt, J.W.1    Szymanski, T.G.2
  • 9
    • 0036211177 scopus 로고    scopus 로고
    • Discovering similar multidimensional trajectories
    • San Jose, CA
    • M. Vlachos, G. Kollios, ans G. Gunopulos, "Discovering Similar Multidimensional Trajectories, " in Proc. of the 18th 1CDE, San Jose, CA, 2002, pp. 673-684.
    • (2002) Proc. of the 18th 1CDE , pp. 673-684
    • Vlachos, M.1    Kollios, G.2    Gunopulos, A.G.3


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