Computer Science

Survival Forest for Left-Truncated Right-Censored Data

Published on - Image Processing On Line

Authors: Vincent Laurent, Olivier Vo Van

The estimation of the lifetime of an industrial equipment or a patient is often based on censored data, because the event of interest is observed only for a subsample of observations. The use of the Random Forest algorithm applied to industrial data is relevant because the algorithm presents robust performances in many applications. Coupled with survival approaches, it can produce time trajectories for each subset of the feature space and thus differentiate observed objects with respect to their lifetimes. Our work aims to generalize the existing tree-based approach CART applied to left-truncated right-censored data to obtain a Random Forest algorithm. We provide a simple API to use such algorithm as well as tools to validate a temporal score against censored data.

Source Code

The source code and documentation for this algorithm are available from the web page of this article 1 . Usage instructions are included in the README.md file of the archive. The original implementation is available here 2 . This is an MLBriefs article, the source code has not been reviewed!