IDEAS home Printed from https://ideas.repec.org/a/kap/compec/v66y2025i3d10.1007_s10614-024-10766-3.html
   My bibliography  Save this article

Mutual Fund Selection Strategies Based on Machine Learning

Author

Listed:
  • Chester S. J. Huang

    (National Kaohsiung University of Science and Technology)

  • Yu-Chuan Huang

    (National Kaohsiung University of Science and Technology)

Abstract

The present study trains and tests the support vector machine (SVR), eXtreme Gradient Boosting (XGBoost), and Light Gradient Boosting Machine (LightGBM) machine learning models by using the data of 684 mutual funds from January 2014 to December 2019 that have been established for more than 5 years. The mutual fund products for which the models have a higher performance prediction accuracy are selected. The ROI of the selected mutual funds are verified by using common investment strategies, such as the lump-sum investment (LSI), dollar-cost averaging (DCA), Bollinger Bands (BBands), and momentum (MOM) strategies. According to the empirical results, the SVR, XGBoost, and LightGBM machine learning models effectively select funds with growth potential and lead to ROI higher than those of the included 684 funds. Furthermore, the positive predicted growth rate of net asset value is identified as a favorable criterion for selecting funds. This study discovers that the SVR model paired with any of the four investment strategies leads to an average rate of return higher than that of the 684 funds.

Suggested Citation

  • Chester S. J. Huang & Yu-Chuan Huang, 2025. "Mutual Fund Selection Strategies Based on Machine Learning," Computational Economics, Springer;Society for Computational Economics, vol. 66(3), pages 2137-2168, September.
    • Handle: RePEc:kap:compec:v:66:y:2025:i:3:d:10.1007_s10614-024-10766-3
    DOI: 10.1007/s10614-024-10766-3
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10614-024-10766-3
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10614-024-10766-3?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

    for a different version of it.

    More about this item

    Keywords

    ;
    ;
    ;
    ;

    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:kap:compec:v:66:y:2025:i:3:d:10.1007_s10614-024-10766-3. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.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.