Invention Grant
US07882126B2 Systems and methods for computation of optimal distance bounds on compressed time-series data
有权
用于计算压缩时间序列数据的最佳距离界限的系统和方法
- Patent Title: Systems and methods for computation of optimal distance bounds on compressed time-series data
- Patent Title (中): 用于计算压缩时间序列数据的最佳距离界限的系统和方法
-
Application No.: US12027294Application Date: 2008-02-07
-
Publication No.: US07882126B2Publication Date: 2011-02-01
- Inventor: Michail Vlachos , Philip Shi-Lung Yu
- Applicant: Michail Vlachos , Philip Shi-Lung Yu
- Applicant Address: US NY Armonk
- Assignee: International Business Machines Corporation
- Current Assignee: International Business Machines Corporation
- Current Assignee Address: US NY Armonk
- Agency: Tutunjian & Bitetto, PC
- Agent William J. Stock, Esq.
- Main IPC: G06F17/30
- IPC: G06F17/30

Abstract:
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.
Public/Granted literature
- US20090204574A1 SYSTEMS AND METHODS FOR COMPUTATION OF OPTIMAL DISTANCE BOUNDS ON COMPRESSED TIME-SERIES DATA Public/Granted day:2009-08-13
Information query