Efficient Similarity Search in Time Series Databases Based on the Minimum Distance

최단거리에 기반한 시계열 데이타의 효율적인 유사 검색

  • 이상준 (서울대학교 전기컴퓨터공학부) ;
  • 권동섭 (서울대학교 전기컴퓨터공학부) ;
  • 이석호 (서울대학교 전기컴퓨터공학부)
  • Published : 2003.04.01

Abstract

The Euclidean distance is sensitive to the absolute offsets of time sequences, so it is not a suitable similarity measure in terms of shape. In this paper. we propose an indexing scheme for efficient matching and retrieval of time sequences based on the minimum distance. The minimum distance can give a better estimation of similarity in shape between two time sequences. Our indexing scheme can match time sequences of similar shapes irrespective of their vortical positions and guarantees no false dismissals

Keywords