首页> 外国专利> SYSTEMS AND METHODS FOR COMPUTATION OF OPTIMAL DISTANCE BOUNDS ON COMPRESSED TIME-SERIES DATA

SYSTEMS AND METHODS FOR COMPUTATION OF OPTIMAL DISTANCE BOUNDS ON COMPRESSED TIME-SERIES DATA

机译:在压缩时间序列数据上计算最佳距离界限的系统和方法

摘要

There are provided a method and a system for computation of optimal distance bounds on compressed time-series data. In a method for similarity search, the method includes the step of transforming sequence data into a compressed sequence represented by top-k coefficients of the sequence data and a sum of the energy of omitted coefficients of the sequence data. The method further includes the step of computing at least one of a lower bound and an upper bound on a distance range between a query sequence and the compressed sequence, given a first and a second constraint. The first constraint is that a sum of squares of the omitted coefficients is less than a sum of the energy of the omitted coefficients. The second constraint is that the energy of the omitted coefficients is less than the energy of a lowest energy one of the top-k coefficients.
机译:提供了一种用于在压缩的时间序列数据上计算最佳距离界限的方法和系统。在用于相似度搜索的方法中,该方法包括以下步骤:将序列数据转换成由序列数据的前k个系数和序列数据的被省略系数的能量之和表示的压缩序列。该方法还包括以下步骤:在给定第一约束和第二约束的情况下,计算查询序列和压缩序列之间的距离范围的下限和上限中的至少一个。第一约束是被省略系数的平方和小于被省略系数的能量的和。第二个约束是被忽略系数的能量小于前k个系数之一的最低能量的能量。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号