首页> 外文会议>International Conference on Digital Information Management >Time Series Classification Method Based on Longest Common Subsequence and Textual Approximation
【24h】

Time Series Classification Method Based on Longest Common Subsequence and Textual Approximation

机译:基于最长常见的子序列和文本近似的时间序列分类方法

获取原文

摘要

Many symbolic representations of time series have been proposed by researchers over past decades. However, it is still not enough to classify time series with high accuracy in such applications as ubiquitous systems or sensor systems. In this paper, we propose a new symbolic representation of time series called l-TAX to increase the accuracy of time series classification. A time series can be represented by term sequences in l-TAX. l-TAX is based on a document like symbolic representation of time series called TAX. We use longest common subsequence as our distance measure between textually approximated time series. During time series classification, consideration of symbol sequences increases the accuracy significantly. In our evaluation, we have demonstrated that l-TAX is effective for classification as well as searching time series data set.
机译:研究人员过去几十年来提出了时间序列的许多象征性表示。 然而,在普遍存在的系统或传感器系统中,在这种应用中以高精度对时序列仍然不足。 在本文中,我们提出了一种新的象征性序列,称为L税,以提高时间序列分类的准确性。 时间序列可以通过L-税中的术语序列来表示。 L-税是基于像时间序列的符号表示等文件。 我们使用最长的常见子序列作为我们在近似时间序列之间的距离测量。 在时间序列分类期间,考虑符号序列的考虑显着增加了精度。 在我们的评估中,我们已经证明L税对于分类是有效的以及搜索时间序列数据集。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号