Querying Time Series Data Based on Similarity
暂无分享,去创建一个
[1] Man Hon Wong,et al. Fast time-series searching with scaling and shifting , 1999, PODS '99.
[2] Hagit Shatkay,et al. Approximate queries and representations for large data sequences , 1996, Proceedings of the Twelfth International Conference on Data Engineering.
[3] Alberto O. Mendelzon,et al. Similarity-based queries for time series data , 1997, SIGMOD '97.
[4] Nick Roussopoulos,et al. Nearest neighbor queries , 1995, SIGMOD '95.
[5] Sudipto Guha,et al. CURE: an efficient clustering algorithm for large databases , 1998, SIGMOD '98.
[6] Raghu Ramakrishnan,et al. MIMSY: A System for Analyzing Time Series Data in the Stock Market Domain , 1993, Workshop on Programming with Logic Databases , ILPS.
[7] Alberto O. Mendelzon,et al. Fourier transform based techniques in efficient retrieval of similar time sequences , 1999 .
[8] Miron Livny,et al. Sequence query processing , 1994, SIGMOD '94.
[9] Kyuseok Shim,et al. Fast Similarity Search in the Presence of Noise, Scaling, and Translation in Time-Series Databases , 1995, VLDB.
[10] Alberto O. Mendelzon,et al. Similarity-based queries , 1995, PODS '95.
[11] Hans-Peter Kriegel,et al. The R*-tree: an efficient and robust access method for points and rectangles , 1990, SIGMOD '90.
[12] Giuseppe Psaila,et al. Querying Shapes of Histories , 1995, VLDB.
[13] Divesh Srivastava,et al. CORAL - Control, Relations and Logic , 1992, VLDB.
[14] Jürg Nievergelt,et al. The Grid File: An Adaptable, Symmetric Multikey File Structure , 1984, TODS.
[15] Stephen A. Dyer,et al. Digital signal processing , 2018, 8th International Multitopic Conference, 2004. Proceedings of INMIC 2004..
[16] Hans-Peter Kriegel,et al. Optimal multi-step k-nearest neighbor search , 1998, SIGMOD '98.
[17] Nick Koudas,et al. Filter Trees for Managing Spatial Data over a Range of Size Granularities , 1996, VLDB.
[18] Sudipto Guha,et al. CURE: an efficient clustering algorithm for large databases , 1998, SIGMOD '98.
[19] Christos Faloutsos,et al. Fast subsequence matching in time-series databases , 1994, SIGMOD '94.
[20] Shane S. Sturrock,et al. Time Warps, String Edits, and Macromolecules – The Theory and Practice of Sequence Comparison . David Sankoff and Joseph Kruskal. ISBN 1-57586-217-4. Price £13.95 (US$22·95). , 2000 .
[21] Christos Faloutsos,et al. A signature technique for similarity-based queries , 1997, Proceedings. Compression and Complexity of SEQUENCES 1997 (Cat. No.97TB100171).
[22] David B. Lomet,et al. The hB-tree: a multiattribute indexing method with good guaranteed performance , 1990, TODS.
[23] SeegerBernhard,et al. The R*-tree: an efficient and robust access method for points and rectangles , 1990 .
[24] Alberto O. Mendelzon,et al. Efficient Retrieval of Similar Time Sequences Using DFT , 1998, FODO.
[25] Antonin Guttman,et al. R-trees: a dynamic index structure for spatial searching , 1984, SIGMOD '84.
[26] Dina Q. Goldin,et al. On Similarity Queries for Time-Series Data: Constraint Specification and Implementation , 1995, CP.
[27] Christos Faloutsos,et al. Efficient Similarity Search In Sequence Databases , 1993, FODO.
[28] Christos Faloutsos,et al. Efficient retrieval of similar time sequences under time warping , 1998, Proceedings 14th International Conference on Data Engineering.
[29] Philip S. Yu,et al. HierarchyScan: a hierarchical similarity search algorithm for databases of long sequences , 1996, Proceedings of the Twelfth International Conference on Data Engineering.