AIM: Approximate intelligent matching for time series data

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1874, Issue , 2000, Pages 347-357

  Kim, Edward D ^a   Lam, Joyce M W ^a   Han, Jiawei ^a  

^a SIMON FRASER UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

DATA MINING; DATA WAREHOUSES; QUERY PROCESSING; WAREHOUSES;

APPROXIMATE MATCHES; HIGH DIMENSIONALITY; PERFORMANCE BOTTLENECKS; SCIENTIFIC DATABASE; SEQUENCE SIMILARITY; SIMILARITY-MATCHING; TIME SERIES DATA MINING; TIME SERIES DATABASE;

TIME SERIES;

EID: 84947550344     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44466-1_35     Document Type: Conference Paper

References (13)

1. R. Agrawal, C. Faloutsos, and A. Swami. Effcient similarity search in sequence databases. In Proc. 4th Int. Conf. Foundations of Data Organization and Algorithms, Chicago, Oct. 1993.
2. R. Agrawal, K.-I. Lin, H. Sawhney, and K. Shim. Fast similarity search in the presence of noise, scaling, and translation in time-series databases. In Proc. 1995 Int. Conf. Very Large Data Bases (VLDB'95), pages 490-501, Zurich, Switzerland, Sept. 1995.
3. N. Beckmann, H.-P. Kriegel, R. Schneider, and B. Seeger. The R*-tree: An effcient and robust access method for points and rectangles. In Proc. 1990 ACM SIGMOD Int. Conf. Management of Data (SIGMOD'90), pages 322-331, Atlantic City, NJ, June 1990.
4. K. Chan and A. Fu. Effcient time series matching by wavelets. In Proc. 1999 Int. Conf. on Data Engineering (ICDE'99), pages 126-133, Sydney, Australia, Mar. 1999.
5. T. H. Cormen, C. E. Leiserson, and R. L. Rivest. Introduction to Algorithms. The MIT Press, Cambridge, Massachusetts, 1990.
6. G. Das, K. Lin, H. Mannila, G. Renganathan, and P. Smyth. Rule discovery from time series. In Proc. 1998 Int. Conf. Knowledge Discovery and Data Mining (KDD'98), pages 16-22, New York, NY, Aug. 1998.
7. C. Faloutsos, M. Ranganathan, and Y. Manolopoulos. Fast subsequence matching in time-series databases. In Proc. 1994 ACM-SIGMOD Int. Conf. Management of Data (SIGMOD'94), pages 419-429, Minneapolis, Minnesota, May 1994.
8. V. Gaede and O. Günther. Multdimensional access methods. ACM Comput. Surv., 30:170-231, 1998.
9. D. Q. Goldin and P. C. Kanellakis. On similarity queries for time-series data: Constraint specification and implementation . In Proc. 1995 Int. Conf. Principles and Practice of Constraint Programming, pages 137-153, Marseilles, France, Sept. 1995.
10. E. Keogh and P. Smyth. A Probablistic Approach to Fast Pattern Matching in Time-Series Databases . In Proc. 1997 Int. Conf. on Knowledge Discovery and Data Mining (KDD'97), Newport Beach, California, Aug. 1997.
11. H. Mannila, H. Toivonen, and A. I. Verkamo. Discovery of frequent episodes in event sequences. Data Mining and Knowledge Discovery, 1:259-289, 1997.
12. D. Rafiei. On similarity-based queries for time series data. In Proc 1999 Int. Conf. on Data Engineering (ICDE'99), pages 410-417, Sydney, Australia, Mar. 1999.
13. B.-K. Yi, H. V. Jagadish, and C. Faloutsos. Effcient retrieval of similar time sequences under time warping. In Proc. 1998 Int. Conf. Data Engineering (ICDE'98), pages 201-208, Orlando, FL, Feb. 1998.