IDEAS home Printed from https://ideas.repec.org/a/spr/alstar/v108y2024i2d10.1007_s10182-024-00501-6.html
   My bibliography  Save this article

Markov-switching decision trees

Author

Listed:
  • Timo Adam

    (University of Copenhagen
    Bielefeld University)

  • Marius Ötting

    (Bielefeld University)

  • Rouven Michels

    (Bielefeld University)

Abstract

Decision trees constitute a simple yet powerful and interpretable machine learning tool. While tree-based methods are designed only for cross-sectional data, we propose an approach that combines decision trees with time series modeling and thereby bridges the gap between machine learning and statistics. In particular, we combine decision trees with hidden Markov models where, for any time point, an underlying (hidden) Markov chain selects the tree that generates the corresponding observation. We propose an estimation approach that is based on the expectation-maximisation algorithm and assess its feasibility in simulation experiments. In our real-data application, we use eight seasons of National Football League (NFL) data to predict play calls conditional on covariates, such as the current quarter and the score, where the model’s states can be linked to the teams’ strategies. R code that implements the proposed method is available on GitHub.

Suggested Citation

  • Timo Adam & Marius Ötting & Rouven Michels, 2024. "Markov-switching decision trees," AStA Advances in Statistical Analysis, Springer;German Statistical Society, vol. 108(2), pages 461-476, June.
    • Handle: RePEc:spr:alstar:v:108:y:2024:i:2:d:10.1007_s10182-024-00501-6
    DOI: 10.1007/s10182-024-00501-6
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10182-024-00501-6
    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/s10182-024-00501-6?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.

    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:spr:alstar:v:108:y:2024:i:2:d:10.1007_s10182-024-00501-6. 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.