【24h】

The Optimal Temporal Common Subsequence

机译:最佳的时间常见的子序列

获取原文

摘要

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.
机译:基于时序和状态序列的正式表征,本文提出了一种名为最佳时间常见通用子序列(OTC)的新算法来测量状态序列之间的相似性。从传统的最长常见的子序列测量中区分,提出了一个名为“时间公共随后”的新概念,以描述时间顺序对状态序列的相似性,以及其他两个必要和重要的时间的相似性字符,即每个状态的时间持续时间和每对相邻状态之间的时间间隙。新闻视频检索的实验结果证明了OTCS的有效性和有效性。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号