Prediction of hierarchical time series using structured regularization and its application to artificial neural networks.
Journal
PloS one
ISSN: 1932-6203
Titre abrégé: PLoS One
Pays: United States
ID NLM: 101285081
Informations de publication
Date de publication:
2020
2020
Historique:
received:
22
07
2020
accepted:
26
10
2020
entrez:
12
11
2020
pubmed:
13
11
2020
medline:
2
1
2021
Statut:
epublish
Résumé
This paper discusses the prediction of hierarchical time series, where each upper-level time series is calculated by summing appropriate lower-level time series. Forecasts for such hierarchical time series should be coherent, meaning that the forecast for an upper-level time series equals the sum of forecasts for corresponding lower-level time series. Previous methods for making coherent forecasts consist of two phases: first computing base (incoherent) forecasts and then reconciling those forecasts based on their inherent hierarchical structure. To improve time series predictions, we propose a structured regularization method for completing both phases simultaneously. The proposed method is based on a prediction model for bottom-level time series and uses a structured regularization term to incorporate upper-level forecasts into the prediction model. We also develop a backpropagation algorithm specialized for applying our method to artificial neural networks for time series prediction. Experimental results using synthetic and real-world datasets demonstrate that our method is comparable in terms of prediction accuracy and computational efficiency to other methods for time series prediction.
Identifiants
pubmed: 33180811
doi: 10.1371/journal.pone.0242099
pii: PONE-D-20-22756
pmc: PMC7660543
doi:
Types de publication
Journal Article
Langues
eng
Sous-ensembles de citation
IM
Pagination
e0242099Déclaration de conflit d'intérêts
KK is an employee of Fujitsu Laboratories Ltd. but this does not alter our adherence to PLOS ONE policies on sharing data and materials.
Références
Ann Stat. 2013 Jun;41(3):1111-1141
pubmed: 26257447
J Comput Graph Stat. 2015;24(3):627-654
pubmed: 26759522