- 1.R. Agrawal, F. Faloutsos and A. Swami. E~cient Similarity Search In Series Databases, The Fourth International Conference on Foundations of Data Organization and Algorithms, Evanston, Illinois, October 1993. Google ScholarDigital Library
- 2.R. Agrawal, K. I. Lin, H. S. Sawhney and K. Sire. Fast Similarity Search in the Presence of Noise, Scaling, and 2~ranslation in Time-series Databases, VLDB, September, 1995. Google ScholarDigital Library
- 3.R. Agrawal, G. Psaila, E. L. Wimmers and M. Zait. Querying Shapes of Histories, VLDB, September, 1995. Google ScholarDigital Library
- 4.P. Boggs, R. Byrd and R. Schnabel. "A stable and efficient algorithm for nonlinear orthogonal distance regression.'' SIAM journal on Scientific and Statistical Computing, Vol. 8, no. 6, Nov. 1987. Google ScholarDigital Library
- 5.P. J. Diggle. Time Series. Clarendon Press, Oxford, 1990.Google Scholar
- 6.C. Faloutsos, M. Ranganthan and Y. Manolopoulos. Fast Subsequence Matching in Time-Series Databases, SIG- MOD, Proc. of Annual Conference, Minneapolis, May 1994. Google ScholarDigital Library
- 7.D. Q. Goldin and P. C. Kanellakis. On Similarity Queries for Time Series Data: Constraint Specification and Implementation, Proc. of the int'l conference on Principles and Practice of Constraint Programming, Casis, France, 1995. Google ScholarDigital Library
- 8.D. Rafiei and A. Mendelzon. Similarity-Based Query for Time Series Data, SIGMOD, 1996. Google ScholarDigital Library
- 9.H. Shatkay and S. B. Zdonik. Approximate Queries and Representations for Large Data Sequence, ICDE, 1996. Google ScholarDigital Library
Index Terms
- Supporting fast search in time series for movement patterns in multiple scales
Recommendations
Supporting Movement Pattern Queries in User-Specified Scales
An important investigation of moving objects involves searching for objects with specific movement patterns, such as "going up," "going towards southwest," or a combination of these. Movement patterns can be in various scales, and larger-scale patterns ...
Large diamond and small pentagon search patterns for fast motion estimation
ICNC'06: Proceedings of the Second international conference on Advances in Natural Computation - Volume Part IIIn fast motion estimation, a search pattern with different shape or size has a very important impact on search speed and distortion performance. A motion estimation algorithm based on the novel large diamond and small pentagon search patterns is ...
Fast Similarity Search Using Multiple Binary Codes
ICPR '14: Proceedings of the 2014 22nd International Conference on Pattern RecognitionOne of the fast similarity search techniques is a binary hashing method that transforms a real-valued vector into a binary code. The similarity between two binary codes is measured by their Hamming distance. In this method, a hash table is often used ...
Comments