Skip to main content
Log in

Filtering financial time series by least squares

  • Original Article
  • Published:
International Journal of Machine Learning and Cybernetics Aims and scope Submit manuscript

Abstract

Modeling of financial time series with artificial intelligence is difficult due to the random nature of the data. The moving average filter is a common and simple form of filter to reduce this noise. There are several of these noise reduction methods used throughout the financial security trading community. The major issue with these filters is the lag between the filtered data and the noisy data. This lag only increases as more noise reduction is desired. In the present marketplace, where investors are competing for quality and timely information, lag can be a hindrance. This paper proposes a new moving average filter derived with the aim of maximizing the level of noise reduction at each delay. Comparison between five different methods has been done and experiment results have shown that our method is a superior noise reducer to the alternatives over short and middle range lag periods.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1

Similar content being viewed by others

References

  1. Donoho DL, Johnstone IM (1995) Adapting to unknown smoothness via wavelet shrinkage. J Am Stat Assoc 90(432):1200–1224

    Article  MathSciNet  MATH  Google Scholar 

  2. Drakakis K (2008) Empirical mode decomposition of financial data. Int Math Forum 3(25):1191–1202

    MathSciNet  MATH  Google Scholar 

  3. Ehlers JF (2001) Rocket science for traders: Digital signal processing applications. John Wiley & Sons, Inc., New York

    Google Scholar 

  4. Ellis CA, Parbery SA (2005) Is smarter better? A comparison of adaptive, and simple moving average trading strategies. Res Int Bus Finance 19(3):399–411

    Article  Google Scholar 

  5. Farmer DJ, Sidorowich JJ (1991) Optimal shadowing and noise reduction. Phys D Nonlinear Phenom 47(3):373–392

    Article  MathSciNet  MATH  Google Scholar 

  6. Gardner JES (2006) Exponential smoothing: The state of the art—part II. Int J Forecast 22(4):637–666

    Article  Google Scholar 

  7. Hale D (2006) Recursive gaussian filters. Techical report, Center for Wave Phenomena

  8. Hassani H, Soofi AS, Zhigljavsky AA (2010) Predicting daily exchange rate with singular spectrum analysis. Nonlinear Anal Real World Appl 11(3):2023–2034

    Article  MathSciNet  MATH  Google Scholar 

  9. Hsu LY, Horng SJ, He M, Fan P, Kao TW, Khan MK et al (2011) Mutual funds trading strategy based on particle swarm optimization. Expert Syst Appl 38(6):7582–7602

    Article  Google Scholar 

  10. Hull A (2004) Hull moving average (HMA), vol 2011, No. March 24th (2011 from http://www.justdata.com.au/Journals/AlanHull/hull_ma.htm)

  11. Kalman RE (1960) A new approach to linear filtering and prediction problems. Trans ASME J Basic Eng 82(Series D):35–45

    Article  Google Scholar 

  12. Kamen EW, Su JK (1999) Introduction to optimal estimation. Springer, London

    Book  MATH  Google Scholar 

  13. Karunasingha DSK, Liong S-Y (2007) Enhancement of chaotic time series prediction with real-time noise reduction. In: International conference on small hydropower—hydro Sri Lanka

  14. Klaas M, Briers M, Freitas Nd, Doucet A, Maskell S, Lang D (2006) Fast particle smoothing: if I had a million particles. In: Proceedings of the 23rd international conference on Machine learning, pp 481–488

  15. Kostelich EJ, Yorke JA (1990) Noise reduction: finding the simplest dynamical system consistent with the data. Phys D Nonlinear Phenom 41(2):183–1963

    Article  MathSciNet  MATH  Google Scholar 

  16. Legoux A (2009) ALMA Arnaud Legous Moving Average. (2011 from http://www.arnaudlegoux.com/wp-content/uploads/2011/03/ALMA-Arnaud-Legoux-Moving-Average.pdf)

  17. Li T, Li Q, Zhu S, Ogihara M (2002) A survey on wavelet applications in data mining. SIGKDD Explor Newsl 4(2):49–68 (772870)

    Article  Google Scholar 

  18. Liu Y, Liao X (2011) Adaptive chaotic noise reduction method based on dual-lifting wavelet. Expert Syst Appl 38(3):1346–1355

    Article  Google Scholar 

  19. Moore JB (1973) Discrete-time fixed-lag smoothing algorithms. Automatica 9(2):163–173

    Article  MATH  Google Scholar 

  20. Nikpour M, Nadernejad E, Ashtiani H, Hassanpour H (2009) Using pde’s for noise reduction in time series. Int J Comput ICT Res 3(1):42–48

    Google Scholar 

  21. Russell SJ, Norvig P (2010) Artificial intelligence: a modern approach. Prentice Hall, New Jersey

    Google Scholar 

  22. Shiu ESW (1987) Matrix derivation of moving-weighted-average graduation formulas. Insur Math Econ 6(1):1–6. (doi:10.1016/0167-6687(87)90002-3)

  23. Shynk JJ (1992) Frequency-domain and multirate adaptive filtering. IEEE Signal Process Mag 9(1):14–37

    Article  Google Scholar 

  24. Soofi AS, Cao L (2002) Nonlinear forecasting of noisy financial data. In: Soofi AS, Cao L (eds) Modeling and forecasting financial data techniques of nonlinear dynamics. Kluwer Academic Publishers, Boston, pp. 455–465

    Chapter  Google Scholar 

  25. Whittaker ET (1923) On a new method of graduation. Proc Edinburgh Math Soc 41(1):63–75

    Google Scholar 

  26. Zehtabian A, Hassanpour H (2009) A non-destructive approach for noise reduction in time domain. World Appl Sci J 6(1):53–63

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Adrian Letchford.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Letchford, A., Gao, J. & Zheng, L. Filtering financial time series by least squares. Int. J. Mach. Learn. & Cyber. 4, 149–154 (2013). https://doi.org/10.1007/s13042-012-0081-0

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s13042-012-0081-0

Keywords

Navigation