Hyper-Heuristics Using Genetic Programming to Time Series Forecasting

被引:0
|
作者
Macedo, Mariana [1 ]
Macedo dos Santos, Carlos Henrique [2 ]
Luizines Van Leijden, Eronita Maria [2 ]
Lorenzato de Oliveira, Joao Fausto [2 ]
de Lima Neto, Fernando Buarque [2 ]
Siqueira, Hugo [3 ]
机构
[1] Florida Inst Technol, Melbourne, FL 32901 USA
[2] Univ Pernambuco, Recife, PE, Brazil
[3] Univ Tecnol Fed Parana, Ponta Grossa, PR, Brazil
关键词
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Time series forecasting methods allow companies and researchers to analyze and predict data that change over time, such as stock exchange and climate change. However, because of their complexity and dynamic nature, each type of time series ideally should be modeled using ad-hoc algorithms. To create a more general methodology, we proposed a combination of meta-heuristics, led by Genetic Programming (GP), to enhance the overall prediction ability. GP may not be as popular as the Box & Jenkins methodology for forecasting tasks, but the literature shows appealing outcomes. Swarm intelligence is also a powerful mechanism for searching patterns in large data spaces. Thus, we investigated and proposed a hybrid method using GP together with the Fish School Search (FSS) algorithm, where the latter is used to select optimal parameters for the former. We also used local search techniques for preventing the Genetic Programming to get stuck in local minima, by refining the coefficients on the GP expression. Our proposal was compared to standard autoregressive integrated moving average (ARIMA) model, exponential smoothing (ETS) and standard GP. The proposed method achieved promising results in one-stepahead predictions and was applied to a well-known time series data library.
引用
收藏
页数:6
相关论文
共 50 条
  • [1] There Is a Free Lunch for Hyper-Heuristics, Genetic Programming and Computer Scientists
    Poli, Riccardo
    Graff, Mario
    [J]. GENETIC PROGRAMMING, 2009, 5481 : 195 - 207
  • [2] On the investigation of hyper-heuristics on a financial forecasting problem
    Michael Kampouridis
    Abdullah Alsheddy
    Edward Tsang
    [J]. Annals of Mathematics and Artificial Intelligence, 2013, 68 : 225 - 246
  • [3] On the investigation of hyper-heuristics on a financial forecasting problem
    Kampouridis, Michael
    Alsheddy, Abdullah
    Tsang, Edward
    [J]. ANNALS OF MATHEMATICS AND ARTIFICIAL INTELLIGENCE, 2013, 68 (04) : 225 - 246
  • [4] Optimizing agents with genetic programming: an evaluation of hyper-heuristics in dynamic real-time logistics
    van Lon, Rinde R. S.
    Branke, Juergen
    Holvoet, Tom
    [J]. GENETIC PROGRAMMING AND EVOLVABLE MACHINES, 2018, 19 (1-2) : 93 - 120
  • [5] Optimizing agents with genetic programming: an evaluation of hyper-heuristics in dynamic real-time logistics
    Rinde R. S. van Lon
    Juergen Branke
    Tom Holvoet
    [J]. Genetic Programming and Evolvable Machines, 2018, 19 : 93 - 120
  • [6] Hyper-Heuristics
    Tauritz, Daniel R.
    Woodward, John
    [J]. PROCEEDINGS OF THE 2016 GENETIC AND EVOLUTIONARY COMPUTATION CONFERENCE (GECCO'16 COMPANION), 2016, : 273 - 304
  • [7] A genetic programming approach to the generation of hyper-heuristics for the uncapacitated examination timetabling problem
    Pillay, Nelishia
    Banzhaf, Wolfgang
    [J]. PROGRESS IN ARTIFICIAL INTELLIGENCE, PROCEEDINGS, 2007, 4874 : 223 - +
  • [8] Test Case Features as Hyper-heuristics for Inductive Programming
    McDaid, Edward
    McDaid, Sarah
    [J]. ARTIFICIAL INTELLIGENCE APPLICATIONS AND INNOVATIONS, PT III, AIAI 2024, 2024, 713 : 362 - 375
  • [9] Novel Ensemble Genetic Programming Hyper-Heuristics for Uncertain Capacitated Arc Routing Problem
    Wang, Shaolin
    Mei, Yi
    Zhang, Mengjie
    [J]. PROCEEDINGS OF THE 2019 GENETIC AND EVOLUTIONARY COMPUTATION CONFERENCE (GECCO'19), 2019, : 1093 - 1101
  • [10] Genetic Programming Hyper-Heuristics with Vehicle Collaboration for Uncertain Capacitated Arc Routing Problems
    MacLachlan, Jordan
    Mei, Yi
    Branke, Juergen
    Zhang, Mengjie
    [J]. EVOLUTIONARY COMPUTATION, 2020, 28 (04) : 563 - 593