IDEAS home Printed from https://ideas.repec.org/a/taf/applec/v50y2018i17p1978-1991.html
   My bibliography  Save this article

Automate the identification of technical patterns: a K-nearest-neighbour model approach

Author

Listed:
  • Daye Li
  • Zhizhong Li
  • Rongrong Li

Abstract

To explore profitable patterns in historical stock prices, ordinarily a promising pattern is selected by rule of thumb, and then its performance is verified by comparing the conditional return of the pattern with the unconditional benchmark return. We adopt an alternative philosophy: without any pre-selected pattern, the proposed method explores the entire graphic space to automate the identification of technical patterns. Derived from the K-nearest-neighbour (KNN) forecast, our method calculates the graphic similarity of patterns by the distance of the price vectors, and then classifies patterns according to the graphic similarity, and finally identifies patterns which contain predictive powers of the future market movement. KNN provides an excellent tool for probing the entire graphic space formed by price patterns to obtain an overall perspective of the effectiveness of technical patterns. Not only the well-known patterns but also the unnoticed and potentially informative patterns can be probed. To evaluate the performance, our method is compared with classic KNN forecast and technical trading rules. Results indicate that the stock market is relatively efficient and technical analysis is still effective to explore excess returns.

Suggested Citation

  • Daye Li & Zhizhong Li & Rongrong Li, 2018. "Automate the identification of technical patterns: a K-nearest-neighbour model approach," Applied Economics, Taylor & Francis Journals, vol. 50(17), pages 1978-1991, April.
  • Handle: RePEc:taf:applec:v:50:y:2018:i:17:p:1978-1991
    DOI: 10.1080/00036846.2017.1383596
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/00036846.2017.1383596
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1080/00036846.2017.1383596?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:taf:applec:v:50:y:2018:i:17:p:1978-1991. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/RAEC20 .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.