References
- R. Agrawal, C. Faloutsos, and A. Swami, 'Efficient Similarity Search in Sequence Databases,' In Proc. Int'l. Conference on Foundations of Data Organization and Algorithms, FODO, pp. 69-84, Oct. 1993
- R. Agrawal et aI., 'Fast Similarity Search in the Presence of Noise, Scaling, and Translation in Time-Series Databases,' In Proc. Int'l Conference on Very Large Data Bases, VLDB, pp, 490-501, Sept. 1995
- C. Faloutsos, M. Ranganathan, and Y. Manolopoulos, 'Fast Subsequence Matching in Timeseries Databases,' In Proc. lnt'l. Conf. on Management of Data, ACM SIGMOD, pp. 419-429, May 1994 https://doi.org/10.1145/191839.191925
- Chen, M. S., Han, J., and Yu, P. S .. 'Data Mining: An Overview from Database Perspective,' IEEE Trans. on Knowledge and Data Engineering, Vol. 8, No.6, pp. 866-883, 1996 https://doi.org/10.1109/69.553155
- D. Rafiei and A. Mendelzon, 'Similarity-Based Queries for Time-Series Data,' In Proc. Int'l Conf. on Management of Data, ACM SIGMOD, pp. 13-24, 1997 https://doi.org/10.1145/253260.253264
- K. K. W. Chu, and M. H. Wong, 'Fast TimeSeries Searching with Scaling and Shifting,' In Proc. Int'l. Symp. on Principles of Database Systems, ACM PODS, pp. 237-248, May 1999 https://doi.org/10.1145/303976.304000
- D. Q. Goldin and P. C. Kanellakis, 'On Similarity Queries for Time-Series Data: Constraint Specification and Implementation,' In Proc. Int'l. Conf. on Principles and Practice qf Constraint Programming, CP, pp. 137-153, Sept. 1995 https://doi.org/10.1007/3-540-60299-2_9
- G. Das, D. Gunopulos, and H. Mannila, 'Finding Similar Time Series,' In Proc. European Symp. on Principles of Data Mining and Knowledge Discovery, PKDD, pp. 88-100, 1997 https://doi.org/10.1007/3-540-63223-9_109
- W. K. Loh, S. W. Kim, and K. Y. Whang, 'Index Interpolation: A Subsequence Matching Algorithm Supporting Moving Average Transform of Arbitrary Order in Time-Series Databases,' IEICE Trans. on Information and Systems, 2000. (accepted to appear)
- W. K. Loh, S. W. Kim, and K. Y. Whang, 'Index Interpolation: An Approach for Subsequence Matching Supporting Normalization Transform in Time-Series Databases, 2000. (submitted for publication)
- D. J. Berndt and J. Clifford, 'Finding Patterns in Time Series: A Dynamic Programming Approach,' Advances in Knowledge Discovery and Data Mining, pp. 229-248, 1996
- B. K. Yi, H. V. Iagadish, and C. Faloutos, 'Efficient Retrieval of Similar Time Sequences Under Time Warping,' In Proc. Int'l. Conf. on Data Engineering, IEEE, pp. 201-208, 1998
- S. H. Park et al., 'Efficient Searches for Similar Subsequences of Difference Lengths in Sequence Databases,' In Proc. Int'l. Conf. on Data Engineering, IEEE, pp. 23-32, 2000
- L. Rabiner and H. H. Juang, Fundamentals of Speech Recognition, Prentice Hall, 1993
-
N. Beckmann et al., 'The
$R^*$ -tree: An Efficient and Robust Access Method for Points and Rectangles,' In Proc. Int'l. Conf. on Management of Data, ACM SIGMOD, pp. 322-331, May 1990 https://doi.org/10.1145/93597.98741 - S. Berchtold, D. A. Keim, and H.P. Kriegel, 'The X -tree: An Index Structure for High-Dimensional Data,' In Proc lnt'l. Coni. on Very Large Data Bases, VLDB, pp. 28-39, 1996
-
T. K. Sellis, N. Roussopoulos, and C. Faloutsos,
$R^{*}$ -Tree: A Dynamic Index for Multi-Dimensional Objects,' In Proc. Int'l. Coni. on Very Large Data Bases, VLDB, 507-518, 1987 - F. P. Preparata and M. Sharnos, Computational Geometry: An Introduction, Springer-Verlag, 1985
- C. Faloutsos and K. I. Lin, 'Fastlvlap: A Fast Algorithm for Indexing, Data-Mining and Visualization of Traditional and Multimedia Datasets,' In Proc. Int'l. Conf. on Management of Data, ACM SIGMOD, pp. 163-174, 1995 https://doi.org/10.1145/223784.223812
- G. A. Stephen, String Searching Algorithms, World Scientific Publishing, 1994
- K. S. Shim, R. Srikant, and R. Agrawal, 'Highdimensional Similarity Joins,' In Proc. Int'l. Conf. on Data Engineering, IEEE, pp, 301-311, Apr. 1997 https://doi.org/10.1109/ICDE.1997.581814
- A. Guttman, 'R-Trees: A Dynamic Index Structure for Spatial Searching,' In Proc. Int'l. Conf. on Mangement of Data, ACM SIGMOD, pp. 47-57, 1984 https://doi.org/10.1145/602259.602266
- J. Bercken, B. Seeger, and P. Widmayer, 'A General Approach to Bulk Loading Multidimensional Index Structures,' In Proc. Int'l. Conf. on Very Large Data Bases, VDLB, pp. 406-415, 1997
- I. Kamel and C. Faloutsos, 'On Packing Rr trees,' In Proc. Int'l. Conf. on Irdormation and Knowledge Management, ACM CIKM, pp. 490-499, 1993 https://doi.org/10.1145/170088.170403
- S. T. Leutenegger, J. M. Edgington, and M. A. Lopez, 'STH: A Simple and Efficient Algorithm for R-Tree Packing,' In Proc. Int'l. Conf. on Data Engineering, IEEE, pp. 497-506, 1997 https://doi.org/10.1109/ICDE.1997.582015