IDEAS home Printed from https://ideas.repec.org/a/hin/complx/5036389.html
   My bibliography  Save this article

Improving the Machine Learning Stock Trading System: An N-Period Volatility Labeling and Instance Selection Technique

Author

Listed:
  • Young Hun Song
  • Myeongseok Park
  • Jaeyun Kim
  • Hiroki Sayama

Abstract

Financial technology is crucial for the sustainable development of financial systems. Algorithmic trading, a key area in financial technology, involves automated trading based on predefined rules. However, investors cannot manually analyze all market patterns and establish rules, necessitating the development of supervised learning trading systems that can discover market patterns using machine or deep learning techniques. Many studies on supervised learning trading systems rely on up–down labeling based on price differences, which overlooks the issues of nonstationarity, complexity, and noise in stock data. Therefore, this study proposes an N-period volatility trading system that addresses the limitations of up–down labeling systems. The N-period volatility trading system measures price volatility to address uncertainty and enables the construction of a stable, long-term trading system. Additionally, an instance†selection technique is utilized to address the limitations of stock data, including noise, nonlinearity, and complexity, while effectively reducing the data size. The effectiveness of the proposed model is evaluated through trading simulations of stocks comprising the NASDAQ 100 index and compared with up–down labeling trading systems. The experimental results demonstrate that the proposed N-period volatility trading system exhibits higher stability and profitability than other trading systems.

Suggested Citation

  • Young Hun Song & Myeongseok Park & Jaeyun Kim & Hiroki Sayama, 2024. "Improving the Machine Learning Stock Trading System: An N-Period Volatility Labeling and Instance Selection Technique," Complexity, Hindawi, vol. 2024, pages 1-16, October.
  • Handle: RePEc:hin:complx:5036389
    DOI: 10.1155/2024/5036389
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/complexity/2024/5036389.pdf
    Download Restriction: no

    File URL: http://downloads.hindawi.com/journals/complexity/2024/5036389.xml
    Download Restriction: no

    File URL: https://libkey.io/10.1155/2024/5036389?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
    ---><---

    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:hin:complx:5036389. 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: Mohamed Abdelhakeem (email available below). General contact details of provider: https://www.hindawi.com .

    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.