Skip to main content

Pattern Recognition in the Japanese Candlesticks

  • Chapter
  • First Online:

Part of the book series: Advances in Intelligent Systems and Computing ((AISC,volume 342))

Abstract

Pattern recognition analysis based on \(k\)-nearest neighbors classifiers is applied to the representation of the stock market dynamics with the help of the Japanese candlesticks augmented by the accompanying volume of transactions. Examples from a post-emerging Warsaw stock market are given. Conditions under which the Japanese candlesticks appear to have a reasonable predictive power are provided. The dependence of the results on the number of nearest neighbors, the length of the candlestick sequence, and the forecast horizon are shown. Possible ways of the forecast improvement are discussed.

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

References

  1. Anderson, T.W.: The Statistical Analysis of Time Series. Wiley, New York (1971)

    MATH  Google Scholar 

  2. Haykin, S.: Adaptive Filter Theory. Prentice-Hall, Englewood Cliffs (1986)

    Google Scholar 

  3. Durbin, J., Koopman, S.J.: Time Series Analysis by State Space Methods. Oxford University Press, Oxford (2001)

    MATH  Google Scholar 

  4. Agrawal, R., Psaila, G., Wimmers, E.L., Zait, M.: Querying shapes of histories. In: Proceedings of the 21st International Conference on Very Large Databases. Zurich, 11–15 September 1995

    Google Scholar 

  5. Camerra, A., Palpanas, T., Shieh, J., Keogh, E.: iSAX 2.0: Indexing and mining one billion time series. In: 2010 IEEE International Conference on Data Mining, ICDM, pp. 58–67 (2010)

    Google Scholar 

  6. Keogh, E., Chakrabarti, K., Pazzani, M.: Locally adaptive dimensionality reduction for indexing large time series databases. In: Proceedings of ACM SIGMOD Conference on Management of Data, Santa Barbara, 21–24 May 2001

    Google Scholar 

  7. Keogh, E., Pazzani, M.: An enhanced representation of time series which allows fast and accurate classification, clustering and relevance feedback. In: Proceedings of the 4th International Conference on Knowledge Discovery and Data Mining. New York, 27–31 August 1998

    Google Scholar 

  8. Liao, T.W.: Clustering of time series data—a survey. Pattern Recognit. 38, 1857 (2005)

    Article  MATH  Google Scholar 

  9. Geurts, P.: Pattern extraction for time series classification. In: Proceedings of the 5th European Conference on Principles of Data Mining and Knowledge Discovery, Freiburg (2001)

    Google Scholar 

  10. Radovanovic, M., Nanopoulos, A., Ivanovic, M.: Time-series classification in many intrinsic dimensions. In: Proceedings of the SIAM International Conference on Data Mining, SDM, Columbus, Ohio, 29 April–1 May 2010

    Google Scholar 

  11. Keogh, E., Lin, J., Fu, A.W.: HOT SAX: Efficiently finding the most unusual time series subsequence. In: Proceedings of the 5th IEEE International Conference on Data Mining, Houston, 27–30 November 2005

    Google Scholar 

  12. Preston, D., Protopapas, P., Brodley, C.: Event discovery in time series. In: Proceedings of the SIAM International Conference on Data Mining, SDM, Sparks, Nevada, 30 April–2 May 2009

    Google Scholar 

  13. Lin, J., Williamson, S., Borne, K., DeBarr, D.: Pattern recognition in time series. In: Way, M., Scargle, J.D., Kamal, M.A., Srivastava, A.N. (eds.) Advances in Machine Learning and Data Mining in Astronomy. J. Chapman and Hall/CRC Press, Boca Raton (2012)

    Google Scholar 

  14. Wiliński, A., Zabłocki, M.: The investment strategy based on the difference of moving averages with parameters adapted by machine learning. In: Wiliński, A., El Fray, I., Pejaś, J. (eds.) Soft Computing in Computer and Information Science, Advances in Intelligent Systems and Computing Series, Vol. 342, Springer, pp. 207–225 (2015)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Arkadiusz Orłowski .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this chapter

Cite this chapter

Chmielewski, L., Janowicz, M., Kaleta, J., Orłowski, A. (2015). Pattern Recognition in the Japanese Candlesticks. In: Wiliński, A., Fray, I., Pejaś, J. (eds) Soft Computing in Computer and Information Science. Advances in Intelligent Systems and Computing, vol 342. Springer, Cham. https://doi.org/10.1007/978-3-319-15147-2_19

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-15147-2_19

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-15146-5

  • Online ISBN: 978-3-319-15147-2

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics