Seasonal time series forecasting by the Walsh-transformation based technique

It is relatively well known that Walsh–Fourier analysis is capable of approximating functions by decomposing them into simple values: 1 and − 1. This method and its valuable characteristics however, are seldom applied in time series forecasting. Moreover, despite the promising applicability of the technique, there is gap in the scientific literature for a comprehensive and detailed introduction and application. Inspired by the results Stoffer (J Time Ser Anal 6:261–267, 1985, J Time Ser Anal 8:449–167, 1987, J Time Ser Anal 11:57–73, 1990, J Am Stat Assoc 86(414):461–479, 1991), Stoffer et al. (J Am Stat Assoc 83:954–963, 1988) and Basu et al. (Electr Power Energy Syst 13(4):193–200, 1991) in the current paper, we aim to describe the theory of Walsh–Fourier analysis, to introduce the so-called Walsh transformation based “row-wise” forecasting process—using the characteristics of the Walsh-matrix—for its application and to compare numerically in R-programming environment (RStudio) using the MComp test data set and the state-of-the-art methods (generic function forecast()) the following two approaches:(1)the 1st of them may be referred to as “direct” since we apply function forecast() to time-series directly in “conventional” mode,(2)and the 2nd one may be called “Walsh-based row-wise” since we apply the same function forecast() to transformed time-series row-wisely. As can be seen—based on our intentions—a significant advantage of the proposed forecasting process is that when forecasting more than one-step ahead it does not use previously forecasted values and, hence, does not accumulate inaccuracy, thus the forecasted results can be more proper compared to other mainstream techniques. Moreover, as show our numeric results the longer the horizon of forecasting, the more attractive relative accuracy achieved.

[1]  S. Lang,et al.  An Introduction to Fourier Analysis and Generalised Functions , 1959 .

[2]  Zhongde Wang In-place and in-order algorithms for Paley- and sequency-ordered Walsh-Hadamard transforms , 1990, IEEE International Symposium on Electromagnetic Compatibility.

[3]  MULTIVARIATE WALSH-FOURIER ANALYSIS , 1990 .

[4]  J. Manz A sequency-ordered fast Walsh transform , 1972 .

[5]  Bogdan C. Bichescu,et al.  Workload Balancing Through Recurrent Subcontracting , 2009 .

[6]  K. R. Rao,et al.  Orthogonal Transforms for Digital Signal Processing , 1979, IEEE Transactions on Systems, Man, and Cybernetics.

[7]  Spyros Makridakis,et al.  ARMA Models and the Box–Jenkins Methodology , 1997 .

[8]  Stanley L. Hurst,et al.  Spectral techniques in digital logic , 1985 .

[9]  U. Goginava On the Uniform Convergence of Walsh-Fourier Series , 2001 .

[10]  L. P. IAroslavskiĭ,et al.  Digital holography and digital image processing : principles, methods, algorithms , 2010 .

[11]  B. Golubov,et al.  Walsh Series and Transforms , 1991 .

[12]  Walsh Spectral Analysis , 1981 .

[13]  R. Kohn,et al.  On the spectral decomposition of stationary time series using walsh functions. II , 1980, Advances in Applied Probability.

[14]  Nasir Ahmed,et al.  On Notation and Definition of Terms Related to a Class of Complete Orthogonal Functions , 1973 .

[15]  P. Purkayastha,et al.  Medium range forecasting of hourly power system load by time series analysis using the Walsh transform , 1991 .

[16]  W. S. Kuklinski,et al.  Fast Walsh transform data-compression algorithm: E.c.g. applications , 1983, Medical and Biological Engineering and Computing.

[17]  C. K. Yuen,et al.  Walsh Functions and Their Applications , 1976, IEEE Transactions on Systems, Man, and Cybernetics.

[18]  David S. Stoffer,et al.  Walsh-Fourier Analysis and its Statistical Applications , 1991 .

[19]  B.J. Falkowski,et al.  Implementation of Walsh function generator of order 64 using LUT cascades , 2004, The 2004 47th Midwest Symposium on Circuits and Systems, 2004. MWSCAS '04..

[20]  T. Sasao,et al.  Unified algorithm to generate Walsh functions in four different orderings and its programmable hardware implementations , 2005 .

[21]  N. Ahmed,et al.  Sequency Theory: Foundations and Applications , 1979, IEEE Transactions on Systems, Man, and Cybernetics.

[22]  V. Kvaratskhelia Unconditional Convergence of Functional Series in Problems of Probability Theory , 2014 .

[23]  Rob J Hyndman,et al.  Automatic Time Series Forecasting: The forecast Package for R , 2008 .

[24]  John L. Shanks,et al.  Computation of the Fast Walsh-Fourier Transform , 1969, IEEE Transactions on Computers.

[25]  K. Jaya Sankar,et al.  Generation of Walsh Codes in Two Different Orderings Using 4-bit Gray and Inverse Gray Codes , 2012 .

[26]  Leonid P. Yaroslavsky,et al.  Digital Picture Processing: An Introduction , 1985 .

[27]  V. Kvaratskhelia,et al.  Some numerical characteristics of Sylvester and Hadamard matrices , 2015, 1507.00636.

[28]  David S. Stoffer,et al.  WALSH‐FOURIER ANALYSIS OF DISCRETE‐VALUED TIME SERIES , 1987 .

[29]  Some Inequalities Related to Hadamard Matrices , 2002 .

[30]  Guy Mélard,et al.  Exponential smoothing: estimation by maximum likelihood , 1990 .

[31]  R. Mcnown,et al.  Forecasting the federal budget with time‐series models , 1992 .

[32]  Christophe Croux,et al.  Robust Forecasting with Exponential and Holt-Winters Smoothing , 2007 .

[33]  Leonid P. Yaroslavsky,et al.  Digital Picture Processing , 1985 .

[34]  A NOTE ON A CENTRAL LIMIT THEOREM FOR STATIONARY PROCESSES , 1983 .

[35]  M. Kunt In place computation of the Hadamard transform in cal-sal order , 1979 .

[36]  David S. Stoffer,et al.  A Walsh—Fourier Analysis of the Effects of Moderate Maternal Alcohol Consumption on Neonatal Sleep-State Cycling , 1988 .

[37]  G. Gát,et al.  Pointwise convergence of cone-like restricted two-dimensional Fejér means of Walsh-Fourier series , 2010 .

[38]  CENTRAL LIMIT THEOREMS FOR FINITE WALSH‐FOURIER TRANSFORMS OF WEAKLY STATIONARY TIME SERIES , 1985 .

[39]  R. D. Brown A Recursive Algorithm for Sequency-Ordered Fast Walsh Transforms , 1977, IEEE Transactions on Computers.

[40]  R. Paley A Remarkable Series of Orthogonal Functions (I) , 1932 .

[41]  J. Walsh A Closed Set of Normal Orthogonal Functions , 1923 .