Online ARIMA algorithms for time series prediction
Autoregressive integrated moving average (ARIMA) is one of the most popular linear models for time series forecasting due to its nice statistical properties and great flexibility. However, its parameters are estimated in a batch manner and its noise terms are often assumed to be strictly bounded, wh...
Saved in:
Main Authors: | , , , |
---|---|
Format: | text |
Language: | English |
Published: |
Institutional Knowledge at Singapore Management University
2016
|
Subjects: | |
Online Access: | https://ink.library.smu.edu.sg/sis_research/3619 https://ink.library.smu.edu.sg/context/sis_research/article/4620/viewcontent/12135_55701_1_PB.pdf |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Singapore Management University |
Language: | English |
id |
sg-smu-ink.sis_research-4620 |
---|---|
record_format |
dspace |
spelling |
sg-smu-ink.sis_research-46202017-04-10T08:46:19Z Online ARIMA algorithms for time series prediction LIU, Chenghao HOI, Steven C. H., ZHAO, Peilin SUN, Jianling Autoregressive integrated moving average (ARIMA) is one of the most popular linear models for time series forecasting due to its nice statistical properties and great flexibility. However, its parameters are estimated in a batch manner and its noise terms are often assumed to be strictly bounded, which restricts its applications and makes it inefficient for handling large-scale real data. In this paper, we propose online learning algorithms for estimating ARIMA models under relaxed assumptions on the noise terms, which is suitable to a wider range of applications and enjoys high computational efficiency. The idea of our ARIMA method is to reformulate the ARIMA model into a task of full information online optimization (without random noise terms). As a consequence, we can online estimation of the parameters in an efficient and scalable way. Furthermore, we analyze regret bounds of the proposed algorithms, which guarantee that our online ARIMA model is provably as good as the best ARIMA model in hindsight. Finally, our encouraging experimental results further validate the effectiveness and robustness of our method. 2016-01-01T08:00:00Z text application/pdf https://ink.library.smu.edu.sg/sis_research/3619 https://ink.library.smu.edu.sg/context/sis_research/article/4620/viewcontent/12135_55701_1_PB.pdf http://creativecommons.org/licenses/by-nc-nd/4.0/ Research Collection School Of Computing and Information Systems eng Institutional Knowledge at Singapore Management University Artificial intelligence Computational efficiency Estimation Optimization Time series Auto-regressive integrated moving average Full informations On-line estimation Online learning algorithms Online optimization Statistical properties Time series forecasting Time series prediction Databases and Information Systems Theory and Algorithms |
institution |
Singapore Management University |
building |
SMU Libraries |
continent |
Asia |
country |
Singapore Singapore |
content_provider |
SMU Libraries |
collection |
InK@SMU |
language |
English |
topic |
Artificial intelligence Computational efficiency Estimation Optimization Time series Auto-regressive integrated moving average Full informations On-line estimation Online learning algorithms Online optimization Statistical properties Time series forecasting Time series prediction Databases and Information Systems Theory and Algorithms |
spellingShingle |
Artificial intelligence Computational efficiency Estimation Optimization Time series Auto-regressive integrated moving average Full informations On-line estimation Online learning algorithms Online optimization Statistical properties Time series forecasting Time series prediction Databases and Information Systems Theory and Algorithms LIU, Chenghao HOI, Steven C. H., ZHAO, Peilin SUN, Jianling Online ARIMA algorithms for time series prediction |
description |
Autoregressive integrated moving average (ARIMA) is one of the most popular linear models for time series forecasting due to its nice statistical properties and great flexibility. However, its parameters are estimated in a batch manner and its noise terms are often assumed to be strictly bounded, which restricts its applications and makes it inefficient for handling large-scale real data. In this paper, we propose online learning algorithms for estimating ARIMA models under relaxed assumptions on the noise terms, which is suitable to a wider range of applications and enjoys high computational efficiency. The idea of our ARIMA method is to reformulate the ARIMA model into a task of full information online optimization (without random noise terms). As a consequence, we can online estimation of the parameters in an efficient and scalable way. Furthermore, we analyze regret bounds of the proposed algorithms, which guarantee that our online ARIMA model is provably as good as the best ARIMA model in hindsight. Finally, our encouraging experimental results further validate the effectiveness and robustness of our method. |
format |
text |
author |
LIU, Chenghao HOI, Steven C. H., ZHAO, Peilin SUN, Jianling |
author_facet |
LIU, Chenghao HOI, Steven C. H., ZHAO, Peilin SUN, Jianling |
author_sort |
LIU, Chenghao |
title |
Online ARIMA algorithms for time series prediction |
title_short |
Online ARIMA algorithms for time series prediction |
title_full |
Online ARIMA algorithms for time series prediction |
title_fullStr |
Online ARIMA algorithms for time series prediction |
title_full_unstemmed |
Online ARIMA algorithms for time series prediction |
title_sort |
online arima algorithms for time series prediction |
publisher |
Institutional Knowledge at Singapore Management University |
publishDate |
2016 |
url |
https://ink.library.smu.edu.sg/sis_research/3619 https://ink.library.smu.edu.sg/context/sis_research/article/4620/viewcontent/12135_55701_1_PB.pdf |
_version_ |
1770573363536723968 |