largest change before reversal is recommended to be used as an output in a neural network for the generation of trading signals. When neural network forecasting is applied to a dataset of Hang Seng Index Futures Contract traded in Hong Kong, it is shown that forecasting the largest change before reversal outperforms the k-step-ahead forecast in achieving higher trading pro®ts. Copyright # 2000 John Wiley & Sons, Ltd.
KEYWORDS ®nance; forecasting; trading rules; largest change before reversal; neural network
`Buy low, sell high' is an investment dictum which is easier said than done. Trading decisions have to be made without the knowledge of future prices and therefore it is impossible to determine whether the current price is a low or a high. For a trading rule to be practicable, it has to satisfy the Markov property as de®ned in Neftci (1991), which is equivalent to saying that trading decisions can only utilize past but not future price information. For the pro®tability of some technical trading rules using past information only, see Taylor (1994) and Corrado and Lee (1992). However, even if we are allowed to make use of future information, it may still be a nontrivial problem to devise an optimal strategy, as we will explain below.
Consider an asset whose prices ¯uctuate from day to day and the closing price on the tth day compounded return on day(t 0, 1, 2,..., n) is qt. Let tp. An investment decision is a vectort ln qt be the log-price and rt pt ÿd ptÿ(d11be the continuously, d2,..., dn), where
* Correspondence to: Kin Lam, Department of Finance and Decision Sciences, School of Business, Hong Kong Baptist University, 224 Waterloo Road, Kowloon, Hong Kong.
CCC 0277±6693/2000/010039±14$17.50 Received July 1997 Accepted December 1998
di 0 or 1, meaning that the investor maintains a `neutral' or a `long' position respectively on day i. Here, we assume that the strategy of short-selling the asset is not available to the investor. This restriction can be lifted by allowing di ÿ1, but we will carry out the discussion here using the simpli®ed version of restricting di to be 0 or 1. Assuming that the investor starts with a certain sum of money and is fully invested when a `long' position is taken, the investment return corresponding to the decision d is given by r Pni1 ridi. Assuming that r1,..., rn are known, r can be maximized by choosing di 1, if ri 40 and di 0, if ri 40.
The optimization problem becomes non-trivial when transaction cost is taken into account. Whenever the investment decision di1 is such that di 6 di1, a transaction cost of 100c% is incurred. Assuming that the investor has a neutral position in the beginning and in the end, i.e. d0 dn1 0, the investment return is given by
r Xi1 ridi ÿ c Xi1 jdi ÿ diÿ1j n n1
The mathematical programming problem (*) of maximizing r with given r1,..., rn and d0 dIn the next section, we give a justi®cation of why (*) is of practical interest and why it hasn1 0 becomes non-trivial. The solution of (*) will be discussed in later sections of this paper. important implications of forecasting for the generation of trading signals in a ®nancial market.
At ®rst sight, the solution of (*) is of no practical interest because the optimal trading decision at
(1991)time t. However, the solution of (*) can give great insights as to which quantity is to be forecasteddepends on the values of rt1, rt2,... and is hence not Markov in the sense of Neftci for the generation of trading signals. When the market satis®es the weak-form market eciency in the sense of Fama (1971), the eorts of generating trading signals would be futile. However, according to Brock, Lakonishok and LeBaron (1992), the ecient market hypothesis has come under serious siege in recent years. Serial correlation in returns over various investment horizons are reported for individual stocks as well as for various portfolio of stocks; see, for example, Fama and French (1986), Poterba and Summers (1988), Jegadeesh (1990), and Cutler, Poterba and Summers (1990). The correlations are statistically signi®cant and sometimes
Уважаемый посетитель!
Чтобы распечатать файл, скачайте его (в формате Word).
Ссылка на скачивание - внизу страницы.