Skip navigation

The optimal temporal common subsequence

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)

[img] PDF
10_16.pdf - Published Version
Restricted to Repository staff only

Download (1MB)

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: Conference Proceedings
Title of Proceedings: 2nd International Conference on Software Engineering and Data Mining, SEDM 2010
Additional Information: This paper forms part of the published proceedings from 2nd International Conference on Software Engineering and Data Mining, SEDM 2010 June 23, 2010 - June 25, 2010 Chengdu, China
Uncontrolled Keywords: state-sequence matching, optimal temporal common subsequence, news video retrieval
Subjects: Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Pre-2014 Departments: School of Computing & Mathematical Sciences
School of Computing & Mathematical Sciences > Department of Computer Science
School of Computing & Mathematical Sciences > Department of Computer Systems Technology
Related URLs:
Last Modified: 14 Oct 2016 09:10
Selected for GREAT 2016: None
Selected for GREAT 2017: None
Selected for GREAT 2018: None
Selected for GREAT 2019: None
URI: http://gala.gre.ac.uk/id/eprint/3886

Actions (login required)

View Item View Item

Downloads

Downloads per month over past year

View more statistics