Skip to main content

MTSC: An Effective Multiple Time Series Compressing Approach

  • Conference paper
  • First Online:
Database and Expert Systems Applications (DEXA 2018)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 11029))

Included in the following conference series:

Abstract

As the volume of time series data being accumulated is likely to soar, time series compression has become essential in a wide range of sensor-data applications, like Industry 4.0 and Smart grid. Compressing multiple time series simultaneously by exploiting the correlation between time series is more desirable. In this paper, we present MTSC, a novel approach to approximate multiple time series. First, we define a novel representation model, which uses a base series and a single value to represent each series. Second, two graph-based algorithms, \(MTSC_{mc}\) and \(MTSC_{star}\), are proposed to group time series into clusters. \(MTSC_{mc}\) can achieve higher compression ratio, while \(MTSC_{star}\) is much more efficient by sacrificing the compression ratio slightly. We conduct extensive experiments on real-world datasets, and the results verify that our approach outperforms existing approaches greatly.

The work is supported by the Ministry of Science and Technology of China, National Key Research and Development Program (No. 2016YFB1000700), National Key Basic Research Program of China (No. 2015CB358800), NSFC (61672163, U1509213), Shanghai Innovation Action Project (No. 16DZ1100200).

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Notes

  1. 1.

    Indeed, for window \(W_i\), the first time point is \((i-1)*w+1\) and the last one is \(i*w\).

References

  1. UCI machine learning repository (2013). http://archive.ics.uci.edu/ml

  2. Climatic Data Center. http://data.cma.cn/

  3. Cheng, A., Hawkins, S., Nguyen, L., Monaco, C., Seagrave, G.: Data compression using Chebyshev transform. US Patent App. 10/633,447 (2004)

    Google Scholar 

  4. Deligiannakis, A., Kotidis, Y., Roussopoulos, N.: Compressing historical information in sensor networks. In: SIGMOD 2004, pp. 527–538 (2004)

    Google Scholar 

  5. Esling, P., Agon, C.: Time-series data mining. ACM Comput. Surv. 45(1), 12:1–12:34 (2012)

    Article  Google Scholar 

  6. Gandhi, S., Nath, S., Suri, S., Liu, J.: Gamps: compressing multi sensor data by grouping and amplitude scaling. In: SIGMOD 2009, pp. 771–784 (2009)

    Google Scholar 

  7. Guha, S., Koudas, N., Shim, K.: Approximation and streaming algorithms for histogram construction problems. TODS 31(1), 396–438 (2006)

    Article  Google Scholar 

  8. Lu, C., Yu, J.X., Wei, H., Zhang, Y.: Finding the maximum clique in massive graphs. VLDB 10(11), 1538–1549 (2017)

    Google Scholar 

  9. Luo, G., et al.: Piecewise linear approximation of streaming time series data with max-error guarantees. In: ICDE 2015, pp. 173–184 (2015)

    Google Scholar 

  10. Nguyen, Q.V.H., Jeung, H., Aberer, K.: An evaluation of model-based approaches to sensor data compression. TKDE 25(11), 2434–2447 (2013)

    Google Scholar 

  11. Östergård, P.R.J.: A fast algorithm for the maximum clique problem. Discrete Appl. Math. 120(1–3), 197–207 (2002)

    Article  MathSciNet  Google Scholar 

  12. Pelkonen, T., Franklin, S., Teller, J., Cavallaro, P., Huang, Q., et al.: Gorilla: a fast, scalable, in-memory time series database. VLDB 8(12), 1816–1827 (2015)

    Google Scholar 

  13. Reiss, C., Wilkes, J., Hellerstein, J.L.: Google cluster-usage traces: format + schema. Technical report, Google Inc. (2011)

    Google Scholar 

  14. Dang, T., Bulusu, N., Feng, W.: RIDA: a robust information-driven data compression architecture for irregular wireless sensor networks. In: Langendoen, K., Voigt, T. (eds.) EWSN 2007. LNCS, vol. 4373, pp. 133–149. Springer, Heidelberg (2007). https://doi.org/10.1007/978-3-540-69830-2_9

    Chapter  Google Scholar 

  15. Ziv, J., Lempel, A.: Compression of individual sequences via variable-rate coding. IEEE Trans. Inf. Theor. 24(5), 530–536 (2006)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Peng Wang .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Pan, N., Wang, P., Wu, J., Wang, W. (2018). MTSC: An Effective Multiple Time Series Compressing Approach. In: Hartmann, S., Ma, H., Hameurlain, A., Pernul, G., Wagner, R. (eds) Database and Expert Systems Applications. DEXA 2018. Lecture Notes in Computer Science(), vol 11029. Springer, Cham. https://doi.org/10.1007/978-3-319-98809-2_17

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-98809-2_17

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-98808-5

  • Online ISBN: 978-3-319-98809-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics