A combination selection algorithm on forecasting

被引:74
作者
Cang, Shuang [1 ]
Yu, Hongnian [2 ]
机构
[1] Bournemouth Univ, Sch Tourism, Poole BH12 5BB, Dorset, England
[2] Bournemouth Univ, Sch Design Engn & Comp, Poole BH12 5BB, Dorset, England
关键词
Neural networks; Seasonal autoregressive integrated moving average; Combination forecast; Information theory; NEURAL-NETWORK MODEL; SUPPORT VECTOR REGRESSION; FINANCIAL TIME-SERIES; TOURISM DEMAND; MUTUAL INFORMATION; ADAPTIVE COMBINATION; WIND-SPEED; UNIT-ROOT; ACCURACY; ARRIVALS;
D O I
10.1016/j.ejor.2013.08.045
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
It is widely accepted in forecasting that a combination model can improve forecasting accuracy. One important challenge is how to select the optimal subset of individual models from all available models without having to try all possible combinations of these models. This paper proposes an optimal subset selection algorithm from all individual models using information theory. The experimental results in tourism demand forecasting demonstrate that the combination of the individual models from the selected optimal subset significantly outperforms the combination of all available individual models. The proposed optimal subset selection algorithm provides a theoretical approach rather than experimental assessments which dominate literature. (C) 2013 Elsevier B.V. All rights reserved.
引用
收藏
页码:127 / 139
页数:13
相关论文
共 81 条