Piecewise linear approximation of streaming time series data with max-error guarantees

Proceedings - International Conference on Data Engineering

Volumn 2015-May, Issue , 2015, Pages 173-184

  Luo, Ge ^a   Yi, Ke ^a   Cheng, Siu Wing ^a   Li, Zhenguo ^b   Fan, Wei ^b   He, Cheng ^b   Mu, Yadong ^c  

^a HONG KONG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Hong Kong)

^b HUAWEI NOAH S ARK LAB   (China)

^c ATandT Labs   (China)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION ALGORITHMS; DATA HANDLING; ERRORS; TIME SERIES;

COLLECTION PROCESS; COMMUNICATION BANDWIDTH; CONTINUOUS PIECEWISE-LINEAR FUNCTION; DISJOINT SEGMENTS; ON-LINE ALGORITHMS; PIECE-WISE LINEAR FUNCTIONS; PIECEWISE LINEAR APPROXIMATIONS; TIME-SERIES DATA;

PIECEWISE LINEAR TECHNIQUES;

EID: 84940860025     PISSN: 10844627     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDE.2015.7113282     Document Type: Conference Paper

References (23)

1. S. H. Cameron, "Piece-wise linear approximations," DTIC Document, Tech. Rep., 1966.
2. C. Aggarwal, "On abnormality detection in spuriously populated data streams," in Proc. SIAM International Conference on Data Mining, 2005.
3. I. Assent, P. Kranen, C. Baldauf, and T. Seidl, "Anyout: Anytime outlier detection on streaming data," in Proc. International Conference on Database Systems for Advanced Applications, 2012.
4. J. O'Rourke, "An on-line algorithm for fitting straight lines between data ranges," Communications of the ACM, vol. 24, no. 9, 1981.
5. H. Elmeleegy, A. K. Elmagarmid, E. Cecchet, W. G. Aref, and W. Zwaenepoel, "Online piece-wise linear approximation of numerical streams with precision guarantees," in Proc. International Conference on Very Large Data Bases, 2009.
6. S. L. Hakimi and E. F. Schmeichel, "Fitting polygonal functions to a set of points in the plane," CVGIP: Graph. Models Image Process., vol. 53, no. 2, pp. 132-136, 1991. [Online]. Available: http://dx. doi. org/10. 1016/1049-9652(91)90056-P
7. I. Lazaridis and S. Mehrotra, "Capturing sensor-generated time series with quality guarantees," in Proc. IEEE International Conference on Data Engineering, 2003.
8. D. Wang, N. Huang, H. Chao, and R. Lee, "Plane sweep algorithms for the polynomial approximation problems with applications," in Proc. International Symposium on Algorithms and Computation, 1993.
9. M. Goodrich, "Efficient piecewise-linear function approximation using the uniform metric," in Proc. Annual Symposium on Computational Geometry, 1994.
10. D. Z. Chen and H. Wang, "Approximating points by a piecewise linear function," Algorithmica, vol. 66, pp. 682-713, 2013.
11. H. V. Jagadish, N. Koudas, S. Muthukrishnan, V. Poosala, K. C. Sevcik, and T. Suel, "Optimal histograms with quality guarantees," in Proc. International Conference on Very Large Data Bases, 1998.
12. S. Guha, N. Koudas, and K. Shim, "Approximation and streaming algorithms for histogram construction problems," ACM Transactions on Database Systems, vol. 31, no. 1, pp. 396-438, 2006.
13. B. Aronov, T. Asano, N. Katoh, K. Mehlhorn, and T. Tokuyama, "Polyline fitting of planar points under min-sum criteria," International Journal of Computational Geometry & Applications, vol. 16, no. 2-3, pp. 97-116, 2006.
14. E. Keogh, S. Chu, D. Hart, and M. Pazzani, "An online algorithm for segmenting time series," in Proc. IEEE International Conference on Data Mining, 2001.
15. T. Palpanas, M. Vlachos, E. Keogh, D. Gunopulos, and W. Truppel, "Online amnesic approximation of streaming time series," in Proc. IEEE International Conference on Data Engineering, 2004.
16. D. Rafiei, "On similarity-based queries for time series data," in Proc. IEEE International Conference on Data Engineering, 1999.
17. B. Yi and C. Faloutsos, "Fast time sequence indexing for arbitrary lpnorms," in Proc. International Conference on Very Large Data Bases, 2000.
18. I. Popivanov and R. J. Miller, "Similarity search over time series data using wavelets," in Proc. IEEE International Conference on Data Engineering, 2002.
19. K. Chakrabarti, E. J. Keogh, S. Mehrotra, and M. J. Pazzani, "Locally adaptive dimensionality reduction for indexing large time series databases," ACM Transactions on Database Systems, vol. 27, no. 2, pp. 188-228, 2002.
20. Y. Cai and R. Ng, "Indexing spatio-temporal trajectories with chebyshev polynomials," in Proc. ACM SIGMOD International Conference on Management of Data, 2004.
21. Q. Chen, L. Chen, X. Lian, Y. Liu, and J. X. Yu, "Indexable PLA for efficient similarity search," in Proc. International Conference on Very Large Data Bases, 2007.
22. H. Imai and M. Iri, "An optimal algorithm for approximating a piecewise linear function," Information Processing Letters, vol. 9, no. 3, pp. 159-162, 1986. [Online]. Available: http://ci. nii. Ac. jp/naid/110002673423/en/
23. E. Kushilevitz and N. Nisan, Communication Complexity. Cambridge University Press, 1997.