The optimal temporal common subsequence

A. Zheng, X. Zhou, J. Ma, Miltiadis Petridis

Research output: Chapter in Book/Conference proceeding with ISSN or ISBNConference contribution with ISSN or ISBN

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.
Original languageEnglish
Title of host publication2nd International Conference on Software Engineering and Data Mining (SEDM)
PublisherIEEE
Pages316-321
Number of pages6
ISBN (Print)9781424473243
Publication statusPublished - 23 Jun 2010
Event2nd International Conference on Software Engineering and Data Mining (SEDM) - Chengdu, 23-25 June, 2010
Duration: 23 Jun 2010 → …

Conference

Conference2nd International Conference on Software Engineering and Data Mining (SEDM)
Period23/06/10 → …

Fingerprint Dive into the research topics of 'The optimal temporal common subsequence'. Together they form a unique fingerprint.

  • Cite this

    Zheng, A., Zhou, X., Ma, J., & Petridis, M. (2010). The optimal temporal common subsequence. In 2nd International Conference on Software Engineering and Data Mining (SEDM) (pp. 316-321). IEEE. http://ieeexplore.ieee.org/xpl/freeabs_all.jsp?arnumber=5542904