Skip to main content

Time Series Analysis Using Fractal Theory and Online Ensemble Classifiers

  • Conference paper
AI 2006: Advances in Artificial Intelligence (AI 2006)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 4304))

Included in the following conference series:

  • 3724 Accesses

Abstract

Fractal analysis is proposed as a concept to establish the degree of persistence and self-similarity within the stock market data. This concept is carried out using the rescaled range analysis (R/S) method. The R/S analysis outcome is applied to an online incremental algorithm (Learn++) that is built to classify the direction of movement of the stock market. The use of fractal geometry in this study provides a way of determining quantitatively the extent to which time series data can be predicted. In an extensive test, it is demonstrated that the R/S analysis provides a very sensitive method to reveal hidden long run and short run memory trends within the sample data. The time series data that is measured to be persistent is used in training the neural network. The results from Learn++ algorithm show a very high level of confidence of the neural network in classifying sample data accurately.

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Freund, Y., Schapire, R.: Stock market prices do not follow random walks: evidence from a simple specification test. Review of Financial Studies, 41–66 (1988)

    Google Scholar 

  2. Mandelbrot, B.: Fractals and scaling in finance: Discontinuity. Springer, Heidelberg (1997)

    MATH  Google Scholar 

  3. Hurst, H.E.: Long-term storage of reservoirs. Transactions of the American Society 116, 770–778 (1951)

    Google Scholar 

  4. Skjeltorp, J.: Scaling in the norwergian stock market. Physica A 283, 486 (2000)

    Article  Google Scholar 

  5. Gammel, B.: Hurst’s rescaled range statistical analysis for pseudorandom number generators used in physical simulations. The American Physical Society 58, 2586 (1998)

    Google Scholar 

  6. Byorick, J., Moreton, M., Marino, A., Polikar, R.: Learn++: A classifier independent incremental learning algorithm. In: Joint Conference on Neural Networks, vol. 31, pp. 1742–1747 (2002)

    Google Scholar 

  7. Littlestone, N., Warmuth, M.: Weighted majority voting algorithm. Information and computer science 108, 212–216 (1994)

    MATH  MathSciNet  Google Scholar 

  8. Polikar, R., Udpa, L., Udpa, S., Honavar, V.: An incremental learning algorithm with confidence estimation for automated identification of nde signals. Transactions on Ultrasonic Ferroelectrics, and Frequency Control 51, 990–1001 (2004)

    Article  Google Scholar 

  9. McIver, D., Friedl, M.: Estimating pixel-scale land cover classification confidence using nonparametric machine learning methods. Transactions on Geoscience and Remote Sensing 39 (2001)

    Google Scholar 

  10. Krause, S., Polikar, R.: An ensemble of classifiers approach for the missing feature proble 553 (2003)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Lunga, D., Marwala, T. (2006). Time Series Analysis Using Fractal Theory and Online Ensemble Classifiers. In: Sattar, A., Kang, Bh. (eds) AI 2006: Advances in Artificial Intelligence. AI 2006. Lecture Notes in Computer Science(), vol 4304. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11941439_35

Download citation

  • DOI: https://doi.org/10.1007/11941439_35

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-49787-5

  • Online ISBN: 978-3-540-49788-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics