Efficient time series data classification and compression in distributed monitoring

1Citations
Citations of this article
15Readers
Mendeley users who have this article in their library.
Get full text

Abstract

As a key issue in distributed monitoring, time series data are a series of values collected in terms of sequential time stamps. Requesting them is one of the most frequent requests in a distributed monitoring system. However, the large scale of these data users request may not only cause heavy loads to the clients, but also cost long transmission time. In order to solve the problem, we design an efficient two-step method: first classify various sets of time series according to their sizes, and then compress the time series with relatively large size by appropriate compression algorithms. This two-step approach is able to reduce the users' response time after requesting the monitoring data, and the compression effects of the algorithms designed are satisfactory. © Springer-Verlag Berlin Heidelberg 2007.

Cite

CITATION STYLE

APA

Di, S., Jin, H., Li, S., Tie, J., & Chen, L. (2007). Efficient time series data classification and compression in distributed monitoring. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4819 LNAI, pp. 389–400). Springer Verlag. https://doi.org/10.1007/978-3-540-77018-3_39

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free