Systems and methods for computation of optimal distance bounds on compressed time-series data
First Claim
1. A method for similarity search, comprising:
- 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; and
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 being a sum of squares of the omitted coefficients being less than a sum of the energy of the omitted coefficients, the second constraint being the energy of the omitted coefficients being less than the energy of a lowest energy one of the top-k coefficients,wherein any of the lower bound and the upper bound is substantially identical to an actual distance between the query sequence and the compressed sequence subject to an amount of compression of at least the compressed sequence.
1 Assignment
0 Petitions
Accused Products
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.
5 Citations
18 Claims
-
1. A method for similarity search, comprising:
-
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; and 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 being a sum of squares of the omitted coefficients being less than a sum of the energy of the omitted coefficients, the second constraint being the energy of the omitted coefficients being less than the energy of a lowest energy one of the top-k coefficients, wherein any of the lower bound and the upper bound is substantially identical to an actual distance between the query sequence and the compressed sequence subject to an amount of compression of at least the compressed sequence. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9)
-
-
10. A computer readable storage medium comprising a computer readable program for similarity search, wherein the computer readable program when executed on a computer causes the computer to perform the steps 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; and 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 being a sum of squares of the omitted coefficients being less than a sum of the energy of the omitted coefficients, the second constraint being the energy of the omitted coefficients being less than the energy of a lowest energy one of the top-k coefficients, wherein any of the lower bound and the upper bound is substantially identical to an actual distance between the query sequence and the compressed sequence subject to an amount of compression of at least the compressed sequence. - View Dependent Claims (11, 12, 13, 14, 15, 16, 17, 18)
-
Specification