The optimal temporal common subsequence

Zheng, Aihua, Zhou, Xiaoyi, Ma, Jixin and Petridis, Miltos (2010) The optimal temporal common subsequence. In: 2nd International Conference on Software Engineering and Data Mining, SEDM 2010. IEEE Computer Society, Piscataway, USA, pp. 316-321. ISBN 9781424473243 (print), 9788988678220 (online)

PDF - Published Version Restricted to Repository staff only Download (1614kB)

Abstract

Based on a formal characterization of time-series and state-sequences, this paper proposes a new algorithm named the Optimal Temporal Common Subsequence (OTCS) to measure the similarity between state-sequences. Distinguishing from the conventional Longest Common Subsequence based measurements, a new concept of common subsequence named ‘temporal common subsequence’ is proposed to describe the similarity of the temporal order over state-sequences, as well as the similarity of the other two essential and vital temporal characters, i.e., the temporal duration of each state and the temporal gaps between each pair of adjacent states. The experimental results on news video retrieval demonstrate the effectiveness and validity of OTCS.

Actions (login required)