Genetic Programming with Wavelet-Based Indicators for Financial Forecasting

Jin Li 1 , Zhu Shi2 and Xiaoli Li1 1 The Centre of Excellence for Research in Computational Intelligence and Applications (CERCIA), School of Computer Science, The University of Birmingham, Edgbaston, Birmingham B15 2TT, UK. 2 School of Software Engineering, The University of Science and Technology of China, P.R.China

Wavelet analysis, as a promising technique, has been used to approach numerous problems in science and engineering. Recent years have witnessed its novel application in economic and finance. This paper is to investigate whether features (or indicators) extracted using the wavelet analysis technique could improve financial forecasting by means of Financial Genetic Programming (FGP), a genetic programming based forecasting tool (i.e., Li, 2001). More specifically, to predict whether Down Jones Industrial Average (DJIA) Index will rise by 2.2% or more within the next 21 trading days, we first extract some indicators based on wavelet coefficients of the DJIA time series using a discrete wavelet transform; we then feed FGP with those wavelet-based indicators to generate decision trees and make predictions. By comparison with the prediction performance of our previous study (i.e., Li and Tsang, 2000), it is suggested that wavelet analysis be capable of bringing in promising indicators, and improving the forecasting performance of FGP.

Address for correspondence: Jin Li, CERCIA, School of Computer Science, The University of Birmingham, Edgbaston, Birmingham B15 2TT, UK. E-Mail: [email protected]

1

1

Introduction

In the past decade, researchers in the fields of applied mathematics and electrical engineering have developed the useful wavelet analysis methods for the multi-scale representation and the analysis of complicated signals. Examples of wavelet applications are turbulence analysis, image compression, earthquake prediction, biomedical signal processing and so forth (e.g., Daubechies, 1992; Li and Yao, 2005; Li et al., 2000; Percival and Walden, 2000; Meyer, 1993). More recent years have witnessed its novel applications in economic and finance (e.g., Pan and Wang, 1998; Ramsey and Zhang, 1997; Ramsey and Lampart, 1998). An overview of wavelets in economic and finance can be found in the references of Gencay et al. (2002) and Ramsey (2002). Often, the wavelet transform is applied as a decomposition tool to analysis financial time series. Applications of wavelets are usually focused on studying the dynamics and correlation of financial time series, including scaling properties of foreign exchange volatility (Gençay et al., 2001), systematic risk in a capital asset pricing model (Gençay et al., 2003), and the relationship between financial variables and real economic activity (Kim and In, 2003). Apart from these, there are also wavelet applications for financial forecasting where wavelet coefficients are directly transformed as features, and input to neural networks for predictions (e.g., Arino, 1996; Aussem et al., 1998; Murtagh et al., 2003). The interest of wavelet analysis in empirical finance is attributed to its advantages. As opposed to the traditional Fourier techniques, wavelet analysis is able to reveal localized information within the data in the time-scale plane. More specifically, it is capable of decomposing an observed time series into a set of multi-scale or multiresolution constituent time series. This makes it suitable for the analysis of nonlinear

2

and non-stationary financial time series. The time scale decomposition leads to a number of benefits for financial analysis. Firstly, in theory, one is able to study a financial time series at as many more time scales as possible, rather than at few traditional time scales, like “long run” and “short run”. In practice, signals are usually decomposed into a number of constituent signals by discrete wavelet transforms. Secondly, through the decomposition, many of anomalies or noises in data can be revealed and therefore can be treated (e.g., being removed) separately if necessary. Finally, from the forecasting point of view, it has been made possible to tailor specific computational forecasting techniques to different constituent time scales and thereby gain efficiency of forecast (Ramsey, 2002). This study applies a discrete wavelet transform to decompose a financial time series. A number of features are derived based on wavelet coefficients. The differences between this study and the existing studies in the literature (e.g., Arino, 1996; Aussem et al., 1998; Murtagh, 2003) are as follows. Firstly, the forms of features are different. The features are derivatives from the wavelet coefficients, rather than the values of coefficients themselves. The indicators extracted in this study reflect the properties of the time series in respect of dynamics and statistics. Secondly, our features are generated using coefficients at a certain level, rather than at all levels, with an attempt of removing possible noise from original data. Finally, our approach adopts the genetic programming technique, rather than Neural Networks, which is able to generate comprehensible decision trees. This makes our method superior to theirs, simply due to the fact that solutions need to be understood by human beings for decision making in finance and economics. The purpose of this study is to investigate whether wavelet analysis could be exploited to improve financial forecasting. We carry out this investigation through a

3

prediction task addressed previously by a genetic programming based tool, Financial Genetic Programming (FGP) (see, Li, 2001). The task is to predict whether an index shall rise by r% or more within the next n periods. Our earlier studies (Li and Tsang, 1999a; 1999b; 2000; Tsang et al., 1998; Tsang and Li, 2002; Tsang et al., 2004) made predictions using some of indicators derived based on some technical analysis rules in textbooks. In this study, predictions shall be made using a number of novel indicators extracted by means of the wavelet analysis technique. It is worth pointing out that such novel indicators would probably have more merit to predictability to future price movement because they could possibly remove potential noises in original data to some extent. Provided that all experimental settings are same, any improvement in the forecasting performance reported in this study could suggest that wavelet analysis be of value to FGP. The structure of the paper is as follows. Section 2 describes FGP system used. Section 3 introduces wavelet analysis and discusses how the wavelet-based indicators are generated using the wavelet analysis technique. In Section 4, experiments and results are reported. The discussions and conclusions are given in the final section.

2

FGP for Financial Forecasting

This section reviews the history of FGP and briefly presents its technical detail for financial forecasting. The measures of its prediction performance are also given.

2.1

Overview of FGP

FGP is main part of the implementation of Evolutionary Dynamic Data Investment Evaluator (EDDIE) (Tsang et al., 1998; Tsang and Li, 2002; Tsang et al., 2004),

4

which is an interactive genetic programming based financial forecasting tool. It aims to help analysts to search the space of interactions and make financial decisions. Given a set of indicators (or features from the point of view of data mining), FGP at tempts to find interactions among indicators and discover appropriate corresponding thresholds for indicators. Using genetic programming, FGP generates Genetic Decision Trees (GDTs), which can be understood by human experts. Human expertise is channeled into FGP through indicators as the input to the system. In this way, experts are allowed to experiment with a variety of indicators more easily. The forecasting performance of FGP crucially depends on the quality of the indicators chosen. This study aims to examine the effectiveness of alternative indicators based on wavelets, instead of some technical analysis indicators used in our previous studies. FGP system has two versions: namely FGP-1 and FGP-2. FGP-1 is designed to be able to improve forecasting accuracy by combining experts’ forecasts from different sources. FGP-2 is designed to be able to improve prediction precision by a constraint handle. The handle allows users to pick up a constraint, i.e. the percentage of opportunities, though possibly at the price of missing opportunities. FGP-2 excels FGP-1 in providing the constraint handle by means of a novel fitness function (see the detail in Section 2.2). Both FGP-1 and FGP-2 have been applied to a variety of financial forecasting problems with demonstrated accuracy (Tsang and Li, 2002). In particular, the efficacy of FGP-2 has been examined intensively through a set of prediction tasks: whether an index will rise by r % or more within the next n periods, denoted by Pnr . In this study, FGP-2 is exploited to attack a task, P212.2 , on the prices of Dow Jones Industrial Average (DJIA). Like our previous study (Li and Tsang, 2000), we still

5

focus the performance of FGP-2 on the prediction precision (see the definition in Section 2.2). FGP-2 generates GDTs to make predictions. An example of GDT is shown below, where a ‘‘Positive’’ prediction means that the goal can be achieved; ‘‘Negative’’ means otherwise. ((IF (MV_50 < -18.45) THEN Positive ELSE (IF TRB_5 > - 19.48) AND (Filter_63 < 36.24) THEN Negative ELSE Positive MV_50, TRB_5 and Filter 63 involved in the GDT belong to three types of technical indicators. They were derived on ground of three simple technical analysis rules in the financial literature, e.g., Alexander (1964), Sweeney (1988) and Brock et al. (1992), namely, moving average rules, filter rules and trade range break rules. These indicators have been argued to have merits to financial forecasting (see Brock et al. 1992, Sweeney 1988). Our previous study (i.e., Li and Tsang, 2000) adopted six indicators as follows to attack P212.2 on DJIA. (1)

MV_12 = Today's price - the average price of the last 12 trading days

(2)

MV_50 = Today's price - the average price of the last 50 trading days

(3)

Filter_5 = Today's price - the minimum price of the last 5 trading days

(4)

Filter_63 = Today's price - the minimum price of the last 63 trading days

(5)

TRB_5 = Today's price - the maximum price of the last 5 trading days

(6)

TRB_50 = Today's price - the maximum price of the last 50 trading days

Nevertheless, to find alternative promising indicators is one of the important motivations in this study. The hope is that any new derived wavelet-based indicators

6

would be better and have more merit to the prediction. As a result, the performance of FGP can be improved in term of the prediction precision. For brevity, how FGP works can be explained in pseudo code below. To know more details of genetic programming technique, interested readers can refer to Koza (1992).

Procedure FGP ( ) Begin Partition whole data into training data and testing data /* While training data is employed to train FGP to find the best-so-far-rule; the testing data is used to determine the performance of predictability of the best-so-far-rule */

Pop Å InitializePopulation(Pop); /*randomly create a population of decision trees. */ Evaluation (Pop);

/* calculate fitness of each individual in Pop

*/

Repeat Pop Å Reproduction (Pop) + Crossover (Pop); /*new population is created after genetic operators of reproduction which reproduces M*Pr individuals and crossover which creates M*(1-Pr) individuals. In our case Pr=0.1, M is population size */

Pop Å Mutation (Pop);

/*apply mutation to population */

Evaluation (Pop); Until (TerminationCondition( )) /* determine if the termination condition is fired */ Apply the best-so-far rule to the testing data; End

7

2.2 Performance Measures of FGP

The prediction problem Pnr can be treated as a binary classification problem. Each day can be classified as either a positive position or a negative position. A positive position predicted by the GDT is sometimes called a buying signal or a recommendation to buy, both of which will be referred to in the following context of this paper. For each GDT, we define the Rate of Correctness (RC), the Rate of Missing Chance (RMC), and the Rate of Failure (RF) as its prediction performance measures. The Rate of Precision (RP) is also given as an important meaningful reference measure for the user, as it measures the accuracy of buying signals. Formulae for each measure is given through a contingency table (Table 1) as follows. Table 1. A contingency table for the binary classification, where a specific prediction rule is invoked. RC =

TP + TN TP + TN = ; O+ + O− N + + N −

# of True Negative Positions [TN] # of False Negative Positions [FN] # of negative positions predicted (N-) = TN+FN

RMC =

FN ; O+

RF = (1- RP)

# of False Positive Positions [FP] # of True Positive Positions [TP] # of positive positions predicted (N+) = FP+TP

=

FP ; N+

Actual # of negative positions (O-) = TN+FP Actual # of positive positions (O+) = FN+TP Number of Cases

As mentioned earlier, FGP-1 generates GDTs, aimed at making prediction as accurately as possible. Thus, RC on its own is an appropriate fitness function for FGP-1. In contrast, FGP-2 attempts to improve prediction precision, i.e., RP, which is equivalent to reducing RF. A lower RF means that each positive recommendation made by the GDT is more likely to be a good and correct opportunity for the investor to make a bid. FGP-2 achieves this target by means of a novel constrained fitness function, which is taken as follows.

8

f = w_rc * RC - w_rmc* RMC – w_rf * RF.

Where 0≤ w_rc, w_rmc, and w_rf ≤ 1

(1)

It involves three performance measures, i.e. RC, RMC and RF, and three weights i.e. w_rc, w_rmc and w_rf . The goodness of a GDT is no longer assessed only by its RC, but by a synthetical value, which is the weighted sum of its three performance rates. The user is allowed to reflect their preferences to any measure by adjusting the weights. Due to the brittleness of the fitness function (cf., Tsang and Li, 2002), a novel constraint parameter, R = [Pmin, Pmax], is introduced into Function 1, which defines the minimum and maximum percentage of recommendations that is used to enforce FGP to achieve in the training data (like most machine learning methods, the assumption is that the test data exhibits similar characteristics). Effectiveness of the constraint in the fitness function for achieving more reliable and accurate predictions has been demonstrated in our numerous previous studies. In general, FGP-2 allows the user to tune a parameter, i.e. constraint R, in order to improve RP without affecting the RC significantly, though at the price of increasing RMC. Such a scenario reoccurs in this study as well (see Section 4). It is worth emphasising again that the performance of FGP crucially depends on the quality of indicators chosen by the users. We argue that the higher quality of the indicators used would almost always lead to better performance of FGP. This is evident in this study.

3

Wavelet-Based Indicators

In this section, a brief introduction of wavelet analysis is given. We then describe the indicators used in this study, which are derived from wavelet coefficients.

9

3.1

Discrete Wavelet Transform

Successful applications in science and engineering demonstrate the wavelet transform is a powerful signal or image processing method. Wavelet transform overcomes the shortcomings of the STFT (short time Fourier transform) by performing a multiresolution analysis of signals (e.g., Meyer, 1993; Daubechies, 1992). The wavelet transform can be used to describe the content of the different frequency over time of a non-stationary time series at a time-scale space. Thus, some of transients that are hidden in the time series can be highlighted. The wavelet transform of a time series x(t) is defined as W ( a, b ) =

1

∫ x(t )ψ a



⎛t −b⎞ ⎜ ⎟dt ⎝ a ⎠

(2)

Where, t is the time, a>0 and b are scale and translation parameters, respectively; ψ (.) is a mother wavelet. W(a ,b) is the coefficients of wavelet transform of x(t). 1/a is proportional to the frequency of the wavelet function. For a small value of a, the wavelet coefficient corresponds roughly to a high frequency component of a time series; whereas a big one corresponds to a low frequency component of the time series. By adjusting scale parameter a, the wavelet transform can flexibly decompose a time series x(t) into multiple resolution constituent time series. Since the wavelet coefficients obtained can indicate local characteristics of a non-stationary time series at the time-scale space, to identify system states, in practice, one often extracts features based on wavelet coefficients. To derive wavelet-based indicators, we apply a discrete wavelet transform to decompose the time series. The discrete wavelet decomposition of a discrete time series

10

x (n) (n=1, 2, …,N), where N is the number of data points in the time series, can be defined as follows: J

x(n) = ∑ C J (k )φ J (2 − J n − k ) + ∑∑ d j (k )ψ j (2 − j n − k ) k

j =1

(3)

k

where dj (k) are called wavelet coefficients at the level j {j = 1, 2, …, J}, and CJ(k) are the coefficients at the maximum resolution level J. Both values of coefficients are varied by position, as indicated by the value of k. The value of J can be set up by users from 1 to a maximum integer number, which is sustainable by N (i.e. 2J < N ).

φ j (.) is called father wavelets whereas ψ j (.) is called mother wavelets, both of which are derivable from a basis wavelet (e.g., the Haar, the Daublet, the Morlet). The father wavelet provides an approximate version of the time series at successive resolutions, whilst the mother wavelet captures the detail at each resolution. In summary, given a time series, a basis wavelet, and a parameter J, both wavelet coefficients, i.e. CJ(k) and dj (k) (j = 1, 2, …, J) can be calculated by a fast recursive scheme (see Meyer, 1993). CJ(k) represents the smooth coefficients that capture the trend of the time series, whereas dj (k), representing increasing finer resolution deviations from the smooth trend, can capture higher frequency oscillations. To what extent that resultant coefficients CJ(k) smooth the time series is determined by the size of J selected. The larger J is, the more smooth part of the time series can be captured by CJ(k). The choice of J is crucial in applications of wavelet analysis to finance and shall be discussed further in Section 4.

11

3.2

Deriving wavelet-based indicators

In this paper, the energy, entropy and others of CJ(k), wavelet coefficients at level J, are calculated and they are taken as indicators for FGP-2. The reason for choosing CJ(k), rather than dj (k), is that CJ(k) captures major trends of a time series whereas dj (k) only captures deviations of the time series. Some of the derived indicators describe the features of a financial time series in dynamics whilst others are mere statistics of a financial time series. Given that a financial time series could potentially reflect dynamics of the movements of financial markets, all indicators could have financial meaning to some extent. The formulae for extracting those features are given below: (1) Energy feature. The feature is based on the amplitude with different frequency of a time series. The energy of wavelet coefficient at each resolutions level j = 1,2,…,J with a sliding window (l is the window size) with index i is written as: ( BE j ) i = (∑ C j (l )) i 2

k

(4)

(2) Entropy feature. The feature is to measure the uncertainty of the wavelet coefficients at the different level j. The pk,j is the probability distribution of a wavelet coefficients at the scale of j. The entropy at each resolutions level j=1,2,…,J based on the wavelet coefficients estimated with a sliding window l with index i is given by ( H j ) i = (−∑ pl , j ln( pl , j )) i l

(5)

(3) Curve Length. The feature is to compute the trajectory of a wavelet coefficient. If a curve length is long, the change of system is severe; slight otherwise. The formula of computation of the curve length is below:

12

CL[ j ] = ∑ C j (i − 1) − C j (i ) l

(5)

i =1

(4) Nonlinear Energy. The feature is to describe the local change of energy information, which can be used to extract the ‘spikes’ in the wavelet coefficients. The equation of nonlinear energy is below:

NE[ j ] = ∑ C j (i) * C j (i ) − C j (i − 1) * C j (i + 1) l

(6)

i =1

(5) Statistic Features. Some basic statistics can also be applied to extract some of features from the wavelet coefficients. They are listed as follows: Mean: Mean[ j ] =

1 l ∑ C j (i ) l i =1

Maximum: f max( j ) = max(C j (1),..., C j ( j )..., C j (l )) Minimum: f min( j ) = min(C j (1),..., C j ( j )..., C j (l ))

(7)

Median: f med ( j ) = median (C j (1),..., C j ( j )..., C j (l )) Standard Deviation: STD ( j ) =

1 l ∑ (C j (i) − mean(C j (i)) 2 l i

All the 9 different indicators are adopted by FGP. Note that any feature above at a time index, i, is calculated using a fixed sliding window that covers preceding l coefficient values (i.e. widow size = l), because only previous coefficients are available at time index i. We did not conduct any feature selection process in this study as genetic programming itself has the capability of selecting more promising indicators adaptively via its genetic operators such as reproduction, crossover and mutation, while evolving decision trees.

13

4

Experiments and Results

As mentioned earlier, this study is to examine whether wavelets-based indicators are able to bring in any benefit to FGP in forecasting. In particular, we are keen to know any performance improvement of FGP-2 in reducing RF, or increasing RP equivalently. Table 2. Tableau for the parameters of FGP-2 experiments Input terminals (9 wavelets-based indicators) Prediction terminals

BE3, H3, CL[3], NE[3], Mean[3], fmax(3), fmin(3), fmed(3), STD(3), and Real values. {0, 1}: 1 means "Positive"; 0 means "Negative".

Non-terminals Crossover rate Mutation rate Population size Maximum no. of generations

If-then-else, And, Or, Not, 0.9. 0.01. 1,200. 30.

Termination criterion

The maximum number of generations has been run or FGP-2 has run for more than 0.5 hours.

Selection strategy

Tournament selection, Size = 4.

Max depth of individual programs

17.

Max depth of initial individual programs

4.

Run times (hours)

0-0.5 hours. Intel® Xeon™ PC 2.8 GHz running Windows 2000 with 2G RAM.

Hardware and operating system

>, ≥, <, ≤, =.

For a fair comparison, we follow our earlier study of Li and Tsang (2000). The major parameter settings for FGP, such as population size, crossover rate, mutation rate, selection strategy and termination criteria, etc., are same and listed in Table 2. The termination criteria are similar as well, which are either that FGP reaches the maximum generation number (i.e., 30), or that it runs out of 30 minutes time we set (as opposed to the maximum running time, 2 hours in our previous study), whichever is achieved first. Except for the 9 novel indicators used here, which replace six technical analysis indicators used previously, there are no other differences at all. Indeed,

14

the dataset used is the same, which are the DJIA closing index data from 07/04/1969 to 09/04/1981 (a total of 3035 trading days). We split up the whole dataset into the training dataset from 07/04/1969 to 11/10/1976 (1,900 trading days) and the test dataset from 12/10/1976 to 09/04/1981 (1135 trading days). Both the training period and the test period contain roughly 50% of positive positions. GDTs, generated by FGP-2 on the training dataset, are tested on the test dataset. We report performance results of the GDTs on the test dataset.

Table 3. The results of 10 GDTs generated by FGP-2 using R1 = [35, 50]. GD Ts GDT 1 GDT 2 GDT 3 GDT 4 GDT 5 GDT 6 GDT 7 GDT 8 GDT 9 G D T 10 M E AN STD

Precision 0.7358 0.7124 0.7128 0.7437 0.7557 0.6659 0.7564 0.7304 0.7169 0.7396 0.7270 0.0254

RM C 0.5389 0.5355 0.5304 0.5000 0.5557 0.5118 0.5541 0.5743 0.5338 0.5490 0.5383 0.0206

RC 0.6326 0.6229 0.6247 0.6493 0.6352 0.6053 0.6361 0.6185 0.6256 0.6308 0.6281 0.0112

TP 273 275 278 296 263 289 264 252 276 267 273.3 12.2

FP 98 111 112 102 85 145 85 93 109 94 103.4 16.7

TN 445 432 431 441 458 398 458 450 434 449 439.6 16.7

FN 319 317 314 296 329 303 328 340 316 325 318.7 12.2

A basis wavelet of Daubechies 4 is used in this study. To calculate those 9 indicators, we set J = 2 and window size = 64 (i.e., l = 64), which deliver better results than those using other levels and/or other window sizes experimentally. Our extensive experiments, which are not reported in this paper, suggest a rule of thumb for selecting the level J and window size l. In general, J is preferable to be a smaller figure more than 1, e.g., 2 or 3, since J = 1 usually results in indicators with lower quality due to possible noisy information in data not being filtered; whilst a higher J (e.g. 4 or 5) usually leads to ineffective indicators, due to useful data information being eliminated probably. Window size l is preferable to be three times longer as the length of future days that the prediction covers. Similarly, any bigger l or smaller l

15

would potentially worsen the indicators derived due to possibly improper information being taken into account. Table 4. t-statistics for comparing mean performances of two groups (the results using the wavelet-based indicators versus the results using the technical indicators for R = [35%, 50%]). t values p values

For RP

For RC

13.32

22.59

For RMC 10.21

2.42E-09

3.34E-11

2.06E-08

Similarly, we take 4 non-overlapped R = [Pmin, Pmax] values (i.e. R1 = [35, 50]; R2 = [20, 35]; R3 = [15, 20]; R4 = [10, 15]) for the constrained fitness function, respectively, and run FGP-2 in turn. For each ℜ, 10 independent runs were completed and total 10 GDTs were produced consequently. Table 3 lists the performances of all 10 GDTs and their mean and standard deviation for R1 = [35, 50]. The RP, RC and RMC are 0.7270, 0.6281 and 0.5383 (which increase 12.76% and 9.09% in RP and RC, respectively and reduce 11.91% in RMC), compared to 0.5994, 0.5372 and 0.6574, respectively, obtained in the earlier study (see, the last row in Table 5). A statistical two-tailed unpaired t-test has been applied to determine whether the results differences between two groups are statistically significant. Shown in Table 4 are t-values and their corresponding p-values under each measure, indicating that the generated GDTs statistically exhibit much better performance under all of three criteria at significant level of α < 1.0E-7. The beauty is that the performance improvement does not scarify the overall number of buying recommendations (i.e. TP+FP), as (377 here) vs. (339 previously) is observed using different indicators.

16

For brevity, for other three Rs, we only list their means and standard deviations in Table 5. The results suggest that the performance of RP have been improved for all of four Rs, though the performances of RMC and RC have not been improved for all four Rs. The experimental here is encouraging because the improvement on RP is what FGP-2 aims to achieve. Therefore, in terms of the prediction precision (i.e. RP), the wavelet-based indicators are superior to the technical analysis indicators in this study. Table 5. The results of means and standard deviations for 4 ℜs in terms of two distinct types of indicators used in FGP-2. M e a n P e rfo rm a n c e U s in g W a v e le ts -b a s e d In d ic a to rs R [1 0 , 1 5 ] [1 5 , 2 0 ] [2 0 ,3 5 ] [3 5 ,5 0 ]

P rec isio n

RM C

RC

TP

FP

TN

FN

M ean

0 .8 5 3 9

0 .9 9 1 9

0 .4 8 1 3

4 .8

1 .5

5 4 1 .5

5 8 7 .2

STD

0 .1 2 0 6

0 .0 1 6 0

0 .0 0 5 1

9 .5

3 .9

3 .9

9 .5

M ean

0 .7 6 8 0

0 .9 3 3 1

0 .5 0 1 2

3 9 .6

1 3 .7

5 2 9 .3

5 5 2 .4

STD

0 .0 8 9 2

0 .0 3 6 6

0 .0 1 3 1

2 1 .7

7 .7

7 .7

2 1 .7

M ean

0 .7 6 4 6

0 .7 6 2 0

0 .5 6 6 5

1 4 0 .9

4 0 .9

5 0 2 .1

4 5 1 .1

STD

0 .0 4 0 7

0 .1 2 3 1

0 .0 4 6 9

7 2 .9

2 0 .6

2 0 .6

7 2 .9

M ean

0 .7 2 7 0

0 .5 3 8 3

0 .6 2 8 1

2 7 3 .3

1 0 3 .4

4 3 9 .6

3 1 8 .7

STD

0 .0 2 5 4

0 .0 2 0 6

0 .0 1 1 2

1 2 .2

1 6 .7

1 6 .7

1 2 .2

M e a n P e rfo rm a n c e U s in g T e c h in c a l A n a ly s is In d ic a to rs R [1 0 , 1 5 ] [1 5 , 2 0 ] [2 0 ,3 5 ] [3 5 ,5 0 ]

5

RF

RM C

RC

TP

FP

TN

FN

M ean

0 .7 1 4 0

0 .9 4 0 5

0 .4 9 7 0

3 5 .2

1 4 .1

5 2 8 .9

5 5 6 .8

STD

0 .0 6 2 2

0 .0 1 6 5

0 .0 0 7 6

9 .8

5 .2

5 .2

9 .8

M ean

0 .6 8 9 8

0 .8 5 6 9

0 .5 1 7 4

8 4 .7

4 0 .4

5 0 2 .6

5 0 7 .3

STD

0 .0 5 2 1

0 .0 6 4 1

0 .0 1 6 7

3 8 .0

2 6 .5

2 6 .5

3 8 .0

M ean

0 .6 4 0 0

0 .7 5 2 5

0 .5 3 4 1

1 4 6 .5

8 3 .3

4 5 9 .7

4 4 5 .5

STD

0 .0 2 5 9

0 .0 5 5 0

0 .0 1 1 9

3 2 .6

2 3 .4

2 3 .4

3 2 .6

M ean

0 .5 9 9 4

0 .6 5 7 4

0 .5 3 7 2

2 0 2 .8

1 3 6 .1

4 0 6 .9

3 8 9 .2

STD

0 .0 1 4 1

0 .0 2 9 9

0 .0 0 4 8

1 7 .7

1 7 .5

1 7 .5

1 7 .7

Discussions and Conclusions

Motivated by potential benefits that wavelet analysis could bring into financial forecasting, in this paper, we have applied the wavelet analysis technique to extract some indicators from wavelet coefficients at a certain level in respect of dynamics and statistics of the time series concerned. In particular, we have examined whether wavelet

17

analysis could be used to improve the forecasting performance of our genetic programming based tool, FGP, through those indicators extracted. Effectiveness of those novel indicators has been demonstrated by tackling a specific prediction task with FGP-2. By comparison with the results in earlier work, our experimental results on DJIA index data have suggested that the novel indicators be capable of producing better forecasting performance in terms of the prediction precision. We may argue that the wavelet-based indicators may have much more merit to the prediction problem studied here in comparison with the technical analysis indicators. We are still far from understanding the role that wavelet analysis could play in financial forecasting. Further research is worth being conducted through answering the following questions. Firstly, should we derive more indicators at different levels, rather than one level in this study, and then make predictions using all indicators at different level; or should we derive indicators, then make a prediction at different levels, and finally make ultimate predictions by combining those individual forecasts? If we do, could we achieve better forecasting results? Secondly, are we better equipped with the wavelet analysis techniques to handle the prediction task here? For example, are our forecasting results sensitive to the choices of wavelets types? Finally, what financial and economic problems are more suitable for wavelet analysis to tackle? If all the above questions could be answered, we believe that we certainly would be in a better position or have a better chance to make wavelet analysis more successful in finance and economic.Given the successes of wavelets in other diverse fields and in finance and economics so far, we would expect positive return in financial applications with wavelets in the future.

18

References 1. Alexander, S.S. 1964:

Price movement in speculative markets: trend or random walks,

No. 2. in: P. Cootner, editor, The Random Character of Stock Market Prices. MIT Press, Cambridge, MA, 338– 372. 2. Arino, M.A. 1996: Forecasting time series via discrete wavelet transform, working paper, Univ. de Navarra, Barcelona. 3. Aussem, A., Campbell, J. and Murtagh, F. 1998: Wavelet-based feature extraction and decomposition strategies for financial forecasting. Journal of Computational Intelligence in Finance, March/April, 5-12. 4. Brock, W., Lakonishok, J. and LeBaron, B. 1992: Simple technical trading rules and the stochastic properties of stock returns. Journal of Finance, 47. 1731– 1764. 5. Daubechies, I. 1992: Ten lectures on wavelets. Conf. Series in Applied Math. SIAM. 6. Fama, E.F. and Blume, M.E. 1966: Filter rules and stock-market trading. Journal of Business 39 (1) 226–241. 7. Gençay, R., Selçuk, F. and Whitcher, B. 2001: Scaling properties of foreign exchange volatility. Physica, 289, 249–266. 8. Gençay, R., Selçuk, F. and Whitcher, B. 2002: An introduction to wavelets and other filtering methods in finance and economics. Academic Press, London. 9. Gençay, R., Selçuk, F. and Whitcher, B. 2003: Systematic risk and time scales. Quantitative Finance, 3, 108-116. 10. Kim, S. and In, F. 2003: The relationship between financial variables and real economic activity: evidence from spectral and wavelet analyses. Studies in Nonlinear Dynamics and Econometrics, Vol.7, No.4. 11. Koza, J.R. 1992: Genetic Programming: On the programming of computers by means of natural selection. MIT Press.

19

12. Li, J. and Tsang, E.P.K. 1999a: Improving technical analysis predictions: an application of genetic programming. Proceedings of the 12th International Florida AI Research Society Conference, Orlando, Florida, 108-112. 13. Li, J. and Tsang, E.P.K. 1999b: Investment decision making using FGP: a case study. Proceedings of the 1999 Congress on Evolutionary Computation, IEEE Press, Washington DC, USA, 1253-1259. 14. Li, J. 2001: FGP: A genetic programming based tool for financial forecasting, PhD Thesis, University of Essex, UK. 15. Li, J. and Tsang, E.P.K. 2000: Reducing failures in investment recommendations using Genetic Programming. Proceedings of the sixth International Conference on Computing in Economics and Finance. Society for Computational Economics, Barcelona. 16. Li, X. and Yao, X. 2005: Multi-scale statistical process monitoring in machining. IEEE Trans. Industrial Electronics. 52, 3, 922-924. 17. Li, X., Tso, S. K. and Wang, J. 2000: Real time tool condition monitoring using wavelet transforms and fuzzy techniques. IEEE Trans Systems, Man, and Cybernetics Part C: Applications and Reviews, Vol. 31, No. 3, 352-357. 18. Murtagh, F, Starck, J.L. and Renaud, O. 2003: On neuro-wavelet modeling. The Journal of Decision Supprort System 37.

475- 484.

19. Percival, D.B. and Walden, A.T. 2000: Wavelet methods for time series analysis. Cambridge Press, Cambridge. 20. Meyer, Y. 1993: Wavelets, applications and algorithms. SIAM. 21. Pan, Z. and Wang, X. 1998:

A stochastic nonlinear regression estimator using wavelets.

Computational Economics 11, 89-102. 22. Ramsey, J. B. and Zhang, Z. 1997: The analysis of foreign exchange data using waveform dictionaries. Journal of Empirical Finance 4, 341–372.

20

23. Ramsey, J. B. and Lampart, C. 1998: The decomposition of economic relationships by time scale using wavelets: Expenditure and income. Studies in Nonlinear Dynamics and Econometrics 3, 23-42. 24. Ramsey, J.B. 2002: Wavelets in economics and finance: past and future. Studies in Nonlinear Dynamics and Econometrics Vol. 6: No. 3, 1-27. 25. Sweeney, R.J. 1988: Some new filter rule tests: Methods and results. Journal of Financial and Quantitative Analysis 23, 285-300. 26. Tsang, E.P.K. and Li, J. 2002: EDDIE for financial forecasting, in S-H. Chen editor, Genetic Algorithms and Programming in Computational Finance. Kluwer Series in Computational Finance, Chapter 7, 161-174. 27. Tsang, E.P.K., Li, J. and Butler, J.M. 1998: EDDIE beats the bookies. International Journal of Software, Practice and Experience Vol.28 (10), Wiley, 1033-1043. 28. Tsang, E.P.K., Yung, P. and Li, J. 2004: EDDIE-automation, a decision support tool for financial forecasting. Journal of Decision Support Systems 37, 559-565.

21

Lecture Notes in Computer Science

forecasting by means of Financial Genetic Programming (FGP), a genetic pro- ... Address for correspondence: Jin Li, CERCIA, School of Computer Science, The ...

131KB Sizes 0 Downloads 290 Views

Recommend Documents

Lecture Notes in Computer Science
study aims to examine the effectiveness of alternative indicators based on wavelets, instead of some technical ..... In this paper, the energy, entropy and others of CJ(k), wavelet coefficients at level J, .... Max depth of initial individual program

Lecture Notes in Computer Science
... S and Geetha T V. Department of Computer Science and Engineering, .... concept than A. If the matching degree is unclassified then either concept A or B is.

Lecture Notes in Computer Science
tinct systems that are used within an enterprising organization. .... files and their networks of personal friends or associates, Meetup organizes local ..... ployed, and in a busy community any deleted pages will normally reappear if they are.

Lecture Notes in Computer Science
This is about twice the data generated in 1999, given an increasing ... the very same pre-processing tools and data have been used by all of them. We chose.

Lecture Notes in Computer Science
Abstract. In this paper, we present an approach for detecting and classifying attacks in computer networks by using neural networks. Specifically, a design of an intruder detection system is presented to protect the hypertext transfer protocol (HTTP)

The Standard Libraries (Lecture Notes in Computer ...
Book synopsis. Ada 2012 is the latest version of the international standard for the programming language Ada. It is designated. ISO/IEC 8652:2012 (E) and is a ...

Lecture Notes in Macroeconomics
Thus if the real interest rate is r, and the nominal interest rate is i, then the real interest rate r = i−π. ... M2 (M1+ savings accounts):$4.4 trillion. Remember that the ...

Lecture Notes in Applied Probability
B M S. There are 5 ways to fill the first position (i.e., Bill's mailbox), 4 ways to fill ..... cording to the “bullet” voting system, a voter must place 4 check marks on ...... 3.36 The Colorful LED Company manufacturers both green and red light

Lecture Notes in Mathematics
I spent the first years of my academic career at the Department of Mathe- matics at ... He is the one to get credit for introducing me to the field of graph complexes ... not 2-connected graphs along with yet another method for computing the.

Lecture Notes in Mathematics 1876
This field is the theory of sets, whose creator was Georg Cantor, . . . , this appears .... quixotic extremes as that of challenging the method of proof by reductio ad.

Inquisitive semantics lecture notes
Jun 25, 2012 - reformulated as a recursive definition of the set |ϕ|g of models over a domain. D in which ϕ is true relative to an assignment g. The inductive ...

Lecture Notes
1. CS theory. M a Compas 3-manifold. A page connetton of gange group G Gəvin)or SU(N). Sas - & + (AndA +š Anka A). G-O(N). SO(N) in this talk. - k integer .... T or Smains the same along row. 2) The # should s down the column. P P P P P spa, Az15)=

Computer Science 75 Fall 2009 Scribe Notes Lecture 4: October 5 ...
interoperable (languages, platforms, applications). ∗ e.g., between Java and Python or between ... markup language), which was developed in the mid-1980s. • To quote W3C: “XML isn't always the best ... it be on the web or mobile devices or in p

Computer Science E-1 Spring 2010 Scribe Notes Lecture 6: March 29 ...
Lecture 6: March 29, 2010. Andrew Sellergren. • One of the pieces of information we can see about computers connected to the same router is the MAC address. These MAC addresses are serial numbers that identify network cards in computers. On some ho

Computer Science E-1 Spring 2010 Scribe Notes Lecture 4: March 1 ...
time. 2 The Internet (3:00–100:00). 2.1 DNS (3:00–5:00, 12:00–20:00). • Recall from last week that when you type in a URL into your browser's address bar, one ...

Computer Science 75 Fall 2009 Scribe Notes Lecture 2: September 21 ...
Project 1 will task you with implementing an online ordering system for our beloved, but now defunct Three Aces Pizza. One of the challenging aspects of this project will be to develop a logical representation of the menu in XML format. The menu itse

Computer Science E-1 Spring 2010 Scribe Notes Lecture 8: April 12 ...
websites are secure prior to submitting personal information 2. do your homework to ensure ... Symantec. They rank the top 5 riskiest cities online as follows: Seattle, .... will become more clear when we dive into a real programming language in a fe

Computer Science 75 Fall 2009 Scribe Notes Lecture 8: November 9 ...
TextMarks, for example, is a service which assists in the process of sending and receiving SMS messages from the web. Most mobile carriers have ... the ability to search by location and to receive the data in RSS format. This meant there was a .....