IDEAS home Printed from https://ideas.repec.org/p/hal/journl/hal-04796167.html
   My bibliography  Save this paper

Time-penalised tree: an interpretable temporal algorithm applied to climate risks
[Time-penalised tree : un algorithme temporel interprétable appliqué aux risques climatiques]

Author

Listed:
  • Mathias Valla

    (Institut Louis Bachelier, I2M - Institut de Mathématiques de Marseille - AMU - Aix Marseille Université - ECM - École Centrale de Marseille - CNRS - Centre National de la Recherche Scientifique)

  • Leonie Le Bastard

    (LSAF - Laboratoire de Sciences Actuarielle et Financière - UCBL - Université Claude Bernard Lyon 1 - Université de Lyon, Finactys)

  • Jose Garrido

    (Concordia University [Montreal])

Abstract

This presentation introduces an innovative decision tree algorithm designed to take into account temporal variables in dynamic environments. Traditional methods often fail when the explanatory variables vary over time, leading to inaccurate forecasts. Our solution, the Time-penalised Tree (TpT) algorithm, uses a time-penalised division criterion, allowing the joint recursive partitioning of the covariate space and time. This approach incorporates historical trends into the construction of the model, providing a clear and interpretable framework. We present the structure and operation of the TpT algorithm, highlighting its advantages over existing methods. A case study on climate risk prediction illustrates the practical application of TpT, showing how it improves the interpretability of forecasts using historical climate data. Since these data form time series, in space and in time, the TpT algorithm also helps in the selection of the most predictive climate variables. We also discuss the theoretical properties of TpT, its effectiveness and its potential application in various fields such as health, finance and insurance. Future research directions are discussed, including the validation and comparison of TpT with other algorithms on various actuarial datasets.

Suggested Citation

  • Mathias Valla & Leonie Le Bastard & Jose Garrido, 2024. "Time-penalised tree: an interpretable temporal algorithm applied to climate risks [Time-penalised tree : un algorithme temporel interprétable appliqué aux risques climatiques]," Post-Print hal-04796167, HAL.
  • Handle: RePEc:hal:journl:hal-04796167
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    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:hal:journl:hal-04796167. 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: CCSD (email available below). General contact details of provider: https://hal.archives-ouvertes.fr/ .

    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.