Micro Similarity Queries in Time Series Database
暂无分享,去创建一个
[1] Hans-Peter Kriegel,et al. The R*-tree: an efficient and robust access method for points and rectangles , 1990, SIGMOD '90.
[2] Hagit Shatkay,et al. Approximate queries and representations for large data sequences , 1996, Proceedings of the Twelfth International Conference on Data Engineering.
[3] David A. Hull. Improving text retrieval for the routing problem using latent semantic indexing , 1994, SIGIR '94.
[4] Ramesh C. Jain,et al. Similarity indexing with the SS-tree , 1996, Proceedings of the Twelfth International Conference on Data Engineering.
[5] Christos Faloutsos,et al. Efficient Similarity Search In Sequence Databases , 1993, FODO.
[6] Christos Faloutsos,et al. Fast subsequence matching in time-series databases , 1994, SIGMOD '94.
[7] Kyuseok Shim,et al. Fast Similarity Search in the Presence of Noise, Scaling, and Translation in Time-Series Databases , 1995, VLDB.
[8] Heikki Mannila,et al. Rule Discovery from Time Series , 1998, KDD.