The optimal temporal common subsequence

Zheng, A., Zhou, X., Ma, J. and PETRIDIS, MILTIADIS (2010) The optimal temporal common subsequence In: 2nd International Conference on Software Engineering and Data Mining (SEDM), Chengdu, 23-25 June, 2010.

Full text not available from this repository.

Official URL: http://ieeexplore.ieee.org/xpl/freeabs_all.jsp?arn...

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.

Item Type:Contribution to conference proceedings in the public domain ( Full Paper)
Subjects:G000 Computing and Mathematical Sciences > G400 Computing
Faculties:Faculty of Science and Engineering > School of Computing, Engineering and Mathematics > Computational Intelligence
ID Code:9718
Deposited By:Converis
Deposited On:18 Jan 2012 12:09
Last Modified:24 Sep 2013 16:55

Repository Staff Only: item control page