Data processing: database and file management or data structures – Database and file access – Record – file – and data search and comparisons
Reexamination Certificate
2011-02-01
2011-02-01
Breene, John E (Department: 2162)
Data processing: database and file management or data structures
Database and file access
Record, file, and data search and comparisons
Reexamination Certificate
active
07882126
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.
REFERENCES:
Saanghyun Park, Fast Retrieval of Similar Subsequences in Long Sequence Databases, Aug. 1999, UCLA-CS-TR-990028.
Adar et al., “Why we Search: Visualizing and Predicting User Behavior”, in Proc. of World Wide Web, pp. 161-170, May 2007.
Agrawal et al., “Efficient Similarity Search in Sequence Databases”, in Proc. of Foundations of Data Organizations (FODO), 15 pages, 1993.
Chen et al., “Improving Query Spelling Correction Using Web Search Results”, Proc. of the 2007 Joint Conference on Empirical Methods in Natural Language Processing and Computational Natural Language, pp. 181-189, Jun. 2007.
Chien et al., “Semantic Similarity Between Search Engine Queries Using Temporal Correlation”, in Proc. of World Wide Web, pp. 2-11, May 2005.
Lie et al., “Measuring the Meaning in Time Series Clustering of Text Search Queries”, in Proc. of CIKM, pp. 836-837, Nov. 2005.
Rafiei et al., “Efficient Retrieval of Similar Time Sequences Using dft”, in Proc. of Foundations of Data Organizations (FODO), 9 pages, Nov. 1998.
Vlachos et al., “Identifying Similarities, Periodicities & Bursts for Online Search Queries”, in Proc. of SIGMOD, 12 pages, Jun. 2004.
Vlachos et al., “On Periodicity Detection and Structural Periodic Similarity”, in Proc. of SDM, pp. 3-12, 2005.
Wang et al., “Multilevel Filtering for High Dimensional Nearest Neighbor Search”, in ACM SIGMOD Workshop on Research Issues in Data Mining and Knowledge Discovery, pp. 1-7, 2000.
Vlachos Michail
Yu Philip Shi-Lung
Breene John E
International Business Machines - Corporation
Le Thu-Nguyet
Stock, Esq. William J.
Tutunjian & Bitetto PC
LandOfFree
Systems and methods for computation of optimal distance... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Systems and methods for computation of optimal distance..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Systems and methods for computation of optimal distance... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-2629065