Fast window correlations over uncooperative time series

Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining

Volumn , Issue , 2005, Pages 743-749

  Cole, Richard ^a   Shasha, Dennis ^a   Zhao, Xiaojian ^a  

^a POLYTECHNIC UNIVERSITY   (United States)

Author keywords

Correlation; Randomized algorithms; Time series

Indexed keywords

GRID STRUCTURES; RANDOMIZED ALGORITHMS;

CORRELATION METHODS; FAST FOURIER TRANSFORMS; SENSORS; TIME SERIES ANALYSIS; VECTORS;

DATA MINING;

EID: 32344446365     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1081870.1081966     Document Type: Conference Paper

References (36)

1. A. Gionis, P. Indyk and R. Motwani, Similarity Search in High Dimensions via Hashing, VLDB, 518-529, 1999
2. S. Mallat and Z. Zhang, Matching Pursuit With Time-Frequency Dictionaries, IEEE Transactions on Signal Processing, 1993
3. T. M. Cover and J. A. Thomas, Elements of Information Theory, New York, Wiley, 1991
4. R. Cole, D. Shasha and X. J. Zhao, Fast Window Correlations Over Uncooperative Time Series, Department of Computer Science, New York University, New York, NY, Technical Report, 2005
5. C. Alexander, Market Models: A Guide to Financial Data Analysis, John Wiley & Sons, 2001
6. Wharton Research Data Services(WRDS), http://wrds.wharton.upenn.edu/
7. E. Keogh and T. Folias, The UCR Time Series Data Mining Archive. Riverside CA. University of California - Computer Science & Engineering Department, http://www.cs.ucr.edu/~eamonn/TSDMA/index.html, 2002
8. B. Efron and R. J. Tibshirani, An Introduction to the Bootstrap, Chapman & Hall/CRC, 1994
9. D. M. Cohen, S. R. Dalal, J. Parelius and G. C. Patton, The Combinatorial Design Approach to Automatic Test Generation, IEEE Software, 13, 83-87, 1996
10. D. Shasha and Y. Zhu, High Performance Discovery in Time Series: Techniques and Case Studies, Springer, 2003
11. D. Achlioptas, Database-friendly Random Projections, ACM SIGMOD-PODS, May, Santa Barbara, CA, 2001
12. P. Indyk, Stable distributions, pseudorandom generators, embeddings and data stream computation, Proceedings of the 41st Annual Symposium on Foundations of Computer Science, 0-7695-0850-2, 189, IEEE Computer Society, 2000
13. E. Kushilevitz, R. Ostrovsky and Y. Ranbani, Efficient Search for Approximate Nearest Neighbors in High Dimensional Spaces, STOC, 1998
14. Y. Zhu and D. Shasha, StatStream: Statistical Monitoring of Thousands of Data Streams in Real Time, VLDB, Hong Kong, China, August, 2002
15. A. C. Gilbert, Y. Kotidis, S. Muthukrishnan and M. Strauss, Surfing wavelets on streams: One-pass summaries for approximate aggregate queries, VLDB, 2001
16. N. Thaper, S. Guha, P. Indyk and N. Koudas, Dynamic multidimensional histograms, SIGMOD, Madison, Wisconsin, 2002
17. P. Indyk, N. Koudas and S. Muthukrishnan, Identifying Representative Trends in Massive Time Series Data Sets using Sketches, VLDB, 2000
18. G. Cormode, P. Indyk, N. Koudas and S. Muthukrishnan, Fast mining of massive tabular data via approximate distance computations, ICDE, 2002
19. W. Johnson and J. Lindenstrauss, Extensions of Lipschitz mapping into hilbert space, Contemporary Mathematics, 26, 189-206, 1984
20. M. Vlachos, M. Hadjieleftheriou, D. Gunopulos and E. Keogh, Indexing multi-dimensional time-series with support for multiple distance measures, SIGKDD, 2003
21. E. Keogh, Exact indexing of dynamic time warping, VLDB, 2002
22. B. K. Yi and C. Faloutsos, Fast time sequence indexing for arbitrary Lp forms, VLDB, 2000
23. T. Palpanas, M. Vlachos, E. Keogh, D. Gunopulos and W. Truppel, Online amnesic approximation of streaming time series, ICDE, 2004
24. E. Keogh, K. Chakrabarti, S. Mehrotra and M. Pazzani, Locally Adaptive Dimensionality Reduction for Indexing large Time Series Databases, SIGMOD, 2001
25. F. Korn, H. V. Jagadish and C. Faloutsos, Efficiently Supporting Ad Hoc Queries in Large Datasets of Time Sequences, SIGMOD, 1997
26. Y. L. Wu, D. Agrawal and A. E. Abbadi, A comparison of dft and dwt based similarity search in time-series databases, The 9th ACM CIKM Int'l Conference on Information and Knowledge Management, 2000
27. I. Popivanov and R. Miller, Similarity Search Over Time Series Data Using Wavelets, ICDE, 2002
28. K. Chan and A. W. Fu, Efficient Time Series Matching by Wavelets, ICDE, 1999
29. D. Rafier and A. Mendelzon, Similarity-based queries for time series data, SIGMOD, 1997
30. C. S. Li, P. S. Yu and V. Castelli, Hierarchyscan: A hierarchical similarity search algorithm for databases of long sequences, ICDE, 1996
31. E. Drinea, P. Drineas and P. Huggins, A Randomized Singular Value Decomposition Algorithm for Image Processing, Panhellenic Conference on Informatics (PCI), 2001
32. G. Manku, S. Rajagopalan and B. Lindsay, Random Sampling Techniques for Space Efficient Online Computation of order Statistics of Large Datasets, SIGMOD, 1999
33. M. Greenwald and S. Khanna, Space-Efficient Online Computation of Quantile Summaries, SIGMOD, 2001
34. R. Agrawal, C. Faloutsos and A. Swami, Efficient Similarity Searching In Sequence Databases, Proceedings of the 4th International Conference of Foundations of Data organization and Algorithms (FODO), Springer Verlag, Chicago, Illinois, MN, 69-84, 1993
35. C. Faloutsos, M. Ranganathan and Y. Manolopoulos, Fast subsequence matching in time-series databases, SIGMOD, Minneapolis, MN, May, 1994
36. E. Keogh, K. Chakrabarti, M. Pazzani and S. Mehrotra, Dimensionality Reduction for fast similarity search in large time series databases, Knowledge and Information Systems, 3, 263-286, 2000