1. R. Agrawal, K. Lin, H. Sawhney, K. Shim, Fast similarity search in the presence of noise, scaling, and translation in time-series databases, in: Proceedings of the 21st International Conference on Very Large Data Bases (VLDB ’95), Atlantic City, NJ, USA, 1995, pp. 490–501.
2. C. Antunes, A. Oliveira, Temporal data mining: an overview, in: Proceedings of Workshop on Temporal Data Mining (KDD’01), San Francisco, CA, USA, 2001, pp. 1–13.
3. Y. Araki, D. Arita, R. Ichiro Taniguchi, Motion motif extraction from high-dimensional motion information, in: Proceedings of the 12th Korea–Japan Joint Workshop on Frontiers of Computer Vision (FCV), Tokushima, Japan, 2006, pp. 92–97.
4. N. Beckmann, H. Kriegel, R. Schneider, B. Seeger, The R*-tree: an efficient and robust access method for points and rectangles, in: Proceedings of the 1990 ACM SIGMOD International Conference on Management of Data (SIGMOD ’90), Atlantic City, NJ, USA, 1990, pp. 322–331.
5. On the approximation of curves by line segments using dynamic programming;Bellman;Communications of the ACM,1961