한국정보과학회:학술대회논문집 (Proceedings of the Korean Information Science Society Conference)
- 한국정보과학회 2003년도 봄 학술발표논문집 Vol.30 No.1 (A)
- /
- Pages.533-535
- /
- 2003
- /
- 1598-5164(pISSN)
최단거리에 기반한 시계열 데이타의 효율적인 유사 검색
Efficient Similarity Search in Time Series Databases Based on the Minimum Distance
초록
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
키워드