K-Line Patterns’ Predictive Power Analysis Using the Methods of Similarity Match and Clustering

Lv Tao, Yongtao Hao, Hao Yijie and Shen Chunfeng

Mathematical Problems in Engineering, 2017, vol. 2017, 1-11

Abstract:

Stock price prediction based on K-line patterns is the essence of candlestick technical analysis. However, there are some disputes on whether the K-line patterns have predictive power in academia. To help resolve the debate, this paper uses the data mining methods of pattern recognition, pattern clustering, and pattern knowledge mining to research the predictive power of K-line patterns. The similarity match model and nearest neighbor-clustering algorithm are proposed for solving the problem of similarity match and clustering of K-line series, respectively. The experiment includes testing the predictive power of the Three Inside Up pattern and Three Inside Down pattern with the testing dataset of the K-line series data of Shanghai 180 index component stocks over the latest 10 years. Experimental results show that the predictive power of a pattern varies a great deal for different shapes and each of the existing K-line patterns requires further classification based on the shape feature for improving the prediction performance.

Date: 2017
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/MPE/2017/3096917.pdf (application/pdf)
http://downloads.hindawi.com/journals/MPE/2017/3096917.xml (text/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jnlmpe:3096917

DOI: 10.1155/2017/3096917

Access Statistics for this article

More articles in Mathematical Problems in Engineering from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().