Detecting structural breaks in time series via genetic algorithms

Detecting structural breaks is an essential task for the statistical analysis of time series, for example, for fitting parametric models to it. In short, structural breaks are points in time at which the behaviour of the time series substantially changes. Typically, no solid background knowledge of the time series under consideration is available. Therefore, a black-box optimization approach is our method of choice for detecting structural breaks. We describe a genetic algorithm framework which easily adapts to a large number of statistical settings. To evaluate the usefulness of different crossover and mutation operations for this problem, we conduct extensive experiments to determine good choices for the parameters and operators of the genetic algorithm. One surprising observation is that use of uniform and one-point crossover together gave significantly better results than using either crossover operator alone. Moreover, we present a specific fitness function which exploits the sparse structure of the break points and which can be evaluated particularly efficiently. The experiments on artificial and real-world time series show that the resulting algorithm detects break points with high precision and is computationally very efficient. A reference implementation with the data used in this paper is available as an applet at the following address: http://www.imm.dtu.dk/~pafi/TSX/. It has also been implemented as package SBRect for the statistics language R.

[1]  Thomas Jansen,et al.  Analysis of evolutionary algorithms: from computational complexity analysis to algorithm engineering , 2011, FOGA '11.

[2]  Wolfgang Härdle,et al.  Localized Realized Volatility Modeling , 2010 .

[3]  Paul De Grauwe,et al.  Mispricing of Sovereign Risk and Multiple Equilibria in the Eurozone , 2012 .

[4]  Kalyanmoy Deb,et al.  Evaluating the -Domination Based Multi-Objective Evolutionary Algorithm for a Quick Computation of Pareto-Optimal Solutions , 2005, Evolutionary Computation.

[5]  Richard A. Davis,et al.  Break Detection for a Class of Nonlinear Time Series Models , 2008 .

[6]  DoerrBenjamin,et al.  Detecting structural breaks in time series via genetic algorithms , 2017 .

[7]  Leonidas J. Guibas,et al.  The Earth Mover's Distance as a Metric for Image Retrieval , 2000, International Journal of Computer Vision.

[8]  Loukia Meligkotsidou,et al.  Detecting structural breaks in multivariate financial time series: evidence from hedge fund investment strategies , 2014 .

[9]  Volker Heun,et al.  Space-Efficient Preprocessing Schemes for Range Minimum Queries on Static Arrays , 2011, SIAM J. Comput..

[10]  Jean-Marc Bardet,et al.  Multiple breaks detection in general causal time series using penalized quasi-likelihood , 2012 .

[11]  Carlo Gaetan,et al.  Subset ARMA Model Identification Using Genetic Algorithms , 2000 .

[12]  Robin Nunkesser,et al.  An evolutionary algorithm for robust regression , 2010, Comput. Stat. Data Anal..

[13]  Mark de Berg,et al.  Computational geometry: algorithms and applications , 1997 .

[14]  Elias Tzavalis,et al.  Detection of structural breaks in linear dynamic panel data models , 2012, Comput. Stat. Data Anal..

[15]  Donald Ervin Knuth,et al.  The Art of Computer Programming , 1968 .

[16]  Zbigniew Michalewicz,et al.  Handbook of Evolutionary Computation , 1997 .

[17]  Richard A. Davis,et al.  Structural Break Estimation for Nonstationary Time Series Models , 2006 .

[18]  Astrid Hilbert,et al.  Fast Detection of Structural Breaks , 2014 .

[19]  Marcelo C. Medeiros,et al.  Nonlinearity, Breaks, and Long-Range Dependence in Time-Series Models , 2016 .

[20]  Elena Marchiori,et al.  Chromosomal Breakpoint Detection in Human Cancer , 2003, EvoWorkshops.

[21]  Thomas C.M. Lee,et al.  AUTOMATIC SMOOTHING FOR DISCONTINUOUS REGRESSION FUNCTIONS , 2002 .

[22]  H. Dette,et al.  Detection of Multiple Structural Breaks in Multivariate Time Series , 2013, 1309.1309.

[23]  Jon Louis Bentley,et al.  Decomposable Searching Problems , 1979, Inf. Process. Lett..