earticle

논문검색

Dynamic Guaranteed Cost Compression for Time Series Big Data

초록

영어

Most time series big data is with noise and uncertain. To abstract the key information effectively and quickly, the estimation is one of the feasible methods for the uncertain big data. The Kalman filter with adaptive method by part of samples can give the high dimensional characteristics, reduce the computing cost and data uncertainty, but encounter the irregular estimation. The number of sample and the performance of the abstracted information have the tradeoff, which means we can use the suitable number of sample to abstract the key information of the series data. This paper discusses how to find the suitable sampling points for the time series data and the simulations show that the key dynamic information of time series big data can be guaranteed with the compression amount number of sample data.

목차

Abstract
 1. Introduction
 2. The Adaptive Dynamic Model
 3. The Estimation Method for the Series Big Data
 4. Simulation Results
 5. Conclusions
 Acknowledgements
 References

저자정보

  • Miao Bei-bei School of Computer and Information Engineering, Beijing Technology and Business University, Beijing, 100048, China
  • Jin Xue-bo School of Computer and Information Engineering, Beijing Technology and Business University, Beijing, 100048, China

참고문헌

자료제공 : 네이버학술정보

    함께 이용한 논문

      ※ 원문제공기관과의 협약기간이 종료되어 열람이 제한될 수 있습니다.

      0개의 논문이 장바구니에 담겼습니다.