Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2401.04489 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866914635409522688 |
|---|---|
| author | Huisman, Tim van der Linden, Jacobus G. M. Demirović, Emir |
| author_facet | Huisman, Tim van der Linden, Jacobus G. M. Demirović, Emir |
| contents | Survival analysis studies and predicts the time of death, or other singular unrepeated events, based on historical data, while the true time of death for some instances is unknown. Survival trees enable the discovery of complex nonlinear relations in a compact human comprehensible model, by recursively splitting the population and predicting a distinct survival distribution in each leaf node. We use dynamic programming to provide the first survival tree method with optimality guarantees, enabling the assessment of the optimality gap of heuristics. We improve the scalability of our method through a special algorithm for computing trees up to depth two. The experiments show that our method's run time even outperforms some heuristics for realistic cases while obtaining similar out-of-sample performance with the state-of-the-art. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2401_04489 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Optimal Survival Trees: A Dynamic Programming Approach Huisman, Tim van der Linden, Jacobus G. M. Demirović, Emir Machine Learning Artificial Intelligence Data Structures and Algorithms Survival analysis studies and predicts the time of death, or other singular unrepeated events, based on historical data, while the true time of death for some instances is unknown. Survival trees enable the discovery of complex nonlinear relations in a compact human comprehensible model, by recursively splitting the population and predicting a distinct survival distribution in each leaf node. We use dynamic programming to provide the first survival tree method with optimality guarantees, enabling the assessment of the optimality gap of heuristics. We improve the scalability of our method through a special algorithm for computing trees up to depth two. The experiments show that our method's run time even outperforms some heuristics for realistic cases while obtaining similar out-of-sample performance with the state-of-the-art. |
| title | Optimal Survival Trees: A Dynamic Programming Approach |
| topic | Machine Learning Artificial Intelligence Data Structures and Algorithms |
| url | https://arxiv.org/abs/2401.04489 |