DocumentCode
525690
Title
The Optimal Temporal Common Subsequence
Author
Zheng, Aihua ; Zhou, Xiaoyi ; Ma, Jixin ; Petridis, Miltos
Author_Institution
Sch. of Comput. & Math. Sci., Univ. of Greenwich, London, UK
fYear
2010
fDate
23-25 June 2010
Firstpage
316
Lastpage
321
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.
Keywords
image matching; information retrieval; time series; video retrieval; essential temporal characters; longest common subsequence algorithm; news video retrieval; optimal temporal common subsequence algorithm; state-sequences; time-series; vital temporal characters; Algorithm design and analysis; Clocks; Continuing education; Data analysis; Dynamic programming; Information retrieval; Length measurement; Time measurement; news video retrieval; optimal temporal common subsequence; state-sequence matching;
fLanguage
English
Publisher
ieee
Conference_Titel
Software Engineering and Data Mining (SEDM), 2010 2nd International Conference on
Conference_Location
Chengdu
Print_ISBN
978-1-4244-7324-3
Electronic_ISBN
978-89-88678-22-0
Type
conf
Filename
5542904
Link To Document