Incremental methods for simple problems in time series: Algorithms and experiments

Proceedings of the International Database Engineering and Applications Symposium, IDEAS

Volumn 2005-January, Issue January, 2005, Pages 3-14

  Zhao, Xiaojian ^a   Zhang, Xin ^a   Neylon, Tyle ^a   Shasha, Dennis ^a  

^a NEW YORK UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DATA COMMUNICATION SYSTEMS; DATABASE SYSTEMS; TIME SERIES;

BURST DETECTION; EMPIRICAL STUDIES; INCREMENTAL COMPUTATION; INCREMENTAL METHOD; MATCHING PURSUIT; MULTIPLE DATA STREAMS; SENSOR TECHNOLOGIES; WINDOWED CORRELATION;

ALGORITHMS;

EID: 78149353154     PISSN: 10988068     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/IDEAS.2005.35     Document Type: Conference Paper

References (45)

1. A. Braverman, Personal Communication, 2003.
2. R. Agrawal, C. Faloutsos, and A. Swami, "Efficient similarity searching in sequence databases," in Proceedings of the 4th International Conference of Foundations of Data organization and Algorithms (FODO), Chicago, Illinois, MN, 1993, pp. 69-84, Springer Verlag.
3. C. Faloutsos, M. Ranganathan, and Y. Manolopou-los, "Fast subsequence matching in time-series databases," in ACM SIGMOD, Minneapolis, MN, May 1994, pp. 419-429.
4. C. Li, P. Yu, and V. Castelli, "Hierarchyscan: A hierarchical similarity search algorithm for databases of long sequences," in IEEE ICDE, New Orleans, Louisiana, February 1996, pp. 546-553.
5. D. Rafier and A. Mendelzon, "Similarity-based queries for time series data," in ACM SIGMOD, Tucson, Arizona, May 1997, pp. 13-25.
6. A. C. Gilbert, Y. Kotidis, S. Muthukrishnan, and M. Strauss, "Surfing wavelets on streams: One-pass summaries for approximate aggregate queries," in VLDB, 2001, pp. 79-88.
7. I. Popivanov and R. Miller, "Similarity search over time series data using wavelets," in IEEE ICDE, San Jose, CA, March 2002, pp. 212-225.
8. F. Korn, H.V. Jagadish, and C. Faloutsos, "Efficiently supporting ad hoc queries in large datasets of time sequences," in ACM SIGMOD, Tucson, Arizona, May 1997, pp. 289-300.
9. E. Keogh, K. Chakrabarti, M. Pazzani, and S. Mehrotra, "Dimensionality reduction for fast similarity search in large time series databases," Knowledge and Information Systems, vol. 3, pp. 263-286, 2000.
10. E. Keogh, K. Chakrabarti, S. Mehrotra, and M. Paz-zani, "Locally adaptive dimensionality reduction for indexing large time series databases," in ACM SIGMOD, Santa Barbara, California, May 2001, pp. 151-162.
11. T. Palpanas, M. Vlachos, E. Keogh, D. Gunopulos, and W. Truppel, "Online amnesic approximation of streaming time series," in IEEE ICDE, Boston, MA, March 2004, pp. 338-350.
12. B. Yi and C. Faloutsos, "Fast time sequence indexing for arbitrary lp forms," in VLDB, Cairo, Egypt, September 2000, pp. 385-394.
13. W. Johnson and J. Lindenstrauss, "Extensions of lipschitz mapping into hilbert space," Contemporary Mathematics, vol. 26, pp. 189-206, 1984.
14. E. Kushikvitz, R. Ostrovsky, and Y. Ranbani, "Efficient search for approximate nearest neighbors in high dimensional spaces," in ACM STOC, Dallas, TX, May 1998, pp. 614-623.
15. P. Indyk, "Stable distributions, pseudorandom generators, embeddings and data stream computation," in Proceedings of the 41st Annual Symposium on Foundations of Computer Science. 2000, pp. 189-197, IEEE Computer Society.
16. D. Achlioptas, "Database-friendly random projections," in ACM SIGMOD, Santa Barbara, California, May 2001, pp. 274-281.
17. Y. Zhu and D. Shasha, "Statstream: Statistical monitoring of thousands of data streams in real time," in VLDB, Hong Kong, China, August 2002, pp. 358-369.
18. D. Shasha and Y. Zhu, High Performance Discovery in Time Series: Techniques and Case Studies, Springer, 2003.
19. P. Indyk, N. Koudas, and S. Muthukrishnan, "Identifying representative trends in massive time series data sets using sketches," in VLDB, Cairo, Egypt, September 2000, pp. 363-372.
20. R. Cole, D. Shasha, and X. Zhao, "Fast window correlations over uncooperative time series," in Submitted to ACM SIGKDD, Chicago, IL, USA, August 2005.
21. E. Keogh and T. Folias, "The ucr time series data mining archive. Riverside CA. University of California - Computer Science & Engineering Department," 2002, http://www.cs.ucr.edu/~eamonn/TSDMA/index.html.
22. "Wharton research data services(wrds)," http://wrds.wharton.upenn.edu/.
23. S. Mallat and Z. Zhang, "Matching pursuit with time-frequency dictionary," IEEE Transactions on Signal Processing, vol. 12, no. 41, pp. 3397-3415, 1993.
24. O. D. Escoda and P. Vandergheynst, "Video coding using a deformation compensation algorithm based on adaptive matching pursuit image decompositions," in IEEE ICIP, Barcelona, Spain, September 2003, pp. 77-80.
25. Y. Wu and V. S. Batista, "Quantum tunneling dynamics in multidimensional systems: A matching-pursuit description," The Journal of Chemical Physics, vol. 121, pp. 1676-1680, 2004.
26. L. Borcea, J. G. Berryman, and G. C. Papanicolaou, "Matching pursuit for imaging high-contrast conductivity," Inverse Problems, vol. 15, pp. 811-849, 1999.
27. P.J. Durka and K.J. Blinowska, "Analysis of EEG transients by means of matching pursuit," Ann. Biomed. Engin., vol. 23, pp. 608-611, 1995.
28. K.J. Blinowska, P.J. Durka, and W. Szelenberger, "Time-frequency analysis of nonstationary EEG by matching pursuit," World Congress of Medical Physics and Biomedical Engineering, August 1994.
29. R. Gribonval, "Fast matching pursuit with a multi-scale dictionary of Gaussian chirps," IEEE Transaction on Signal Processing, vol. 49, no. 5, pp. 994-1001, MAY 2001.
30. F. Moschetti, L. Granai, P. Vandergheynst, and P. Frossard, "New dictionary and fast atom searching method for matching pursuit representation of displaced frame difference," in IEEE ICIP, Rochester, NY, September 2002, pp. 685-688.
31. K. Cheung and Y. Chan, "A fast two-stage algorithm for realizing matching pursuit," in IEEE ICIP, Thessaloniki Greece, October 2001, pp. 431-434.
32. A.J. Hoffman and S.T. McCormick, "A fast algorithm that makes matrices optimally sparse," in Progress in Combinatorial Optimization, William R. Pulleyblank, Ed., pp. 185-196. Academic Press, 1984.
33. A. Topcu, A contribution to the systematic analysis of finite element structures through the force method, Ph.D. thesis, University of Essen, Essen, Germany, 1979, (In German).
34. T.F. Coleman and A. Pothen, "The null space problem I. complexity," SIAM Journal on Algebraic and Discrete Methods, vol. 7, no. 4, pp. 527-537, Oct. 1986.
35. J.R. Gilbert and M.T. Heath, "Computing a sparse basis for the null space," SIAM Journal on Algebraic and Discrete Methods, vol. 8, no. 3, pp. 446-459, July 1987.
36. T.F. Coleman and A. Pothen, "The null space problem II. algorithms," SIAM Journal on Algebraic and Discrete Methods, vol. 8, no. 4, pp. 544-563, Oct. 1987.
37. M. Wang, T. Madhyastha, N. Chan, S. Papadim-itriou, and C. Faloutos, "Data mining meets performance evaluation: Fast algorithms for modeling bursty traffic," in IEEE ICDE, San Jose, CA, March 2002, pp. 507-516.
38. J. Kleinberg, "Bursty and hierarchical structure in streams," in ACM SIGKDD, Edmonton, Alberta, Canada, July 2002, pp. 91-101.
39. M. Vlachos, C. Meek, and Z. Vagena, "Identifying similarity and periodicities and bursts for online search queries," in ACM SIGMOD, Paris, France, June 2004, pp. 131-142.
40. Daniel B. Neill and Andrew W. Moore, "A fast multi-resolution method for detection of significant spatial disease clusters," in Advances in Neural Information Processing Systems 16, Sebastian Thrun, Lawrence Saul, and Bernhard Schölkopf, Eds., Cambridge, MA, 2004, pp. 651-658, MIT Press.
41. D. Neill and A. Moore, "Rapid detection of significant spatial clusters," in ACM SIGKDD, Seattle, WA, August 2004, pp. 256-265.
42. Daniel B. Neill, Andrew W. Moore, Francisco Pereira, and Tom Mitchell, "Detecting significant multidimensional spatial clusters," in Advances in Neural Information Processing Systems 17, Lawrence K. Saul, Yair Weiss, and Léon Bot-tou, Eds., Cambridge, MA, 2005, pp. 969-976, MIT Press.
43. Mayur Datar, Aristides Gionis, Piotr Indyk, and Rajeev Motwani, "Maintaining stream statistics over sliding windows," SIAM, vol. 31, no. 6, pp. 1794-1813, September 2002.
44. Phillip B. Gibbons and Srikanta Tirthapura, "Distributed stream algorithms for sliding windows," in Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures, 2002, pp. 63-72.
45. X. Zhang, "High performance burst detection," Thesis Proposal, 2005.