.png){kind=icon}
.png){kind=icon}
Return
High-Dimensional Variable Selection for Survival Data
.png){kind=icon}
PRE
AI
DOI：10.1198/jasa.2009.tm08622.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The minimal depth of a maximal subtree IN a dimensionless order statistic measuring the predictiveness of a variable in a survival tree We derive the distribution of the minimal depth and use it lot high-dimensional variable selection using random survival forests In big p and small n problems (where p is the dimension and n Is the sample size). the distribution of the minimal depth reveals a ceiling effect in which a tree simply cannot be grown deep enough to properly identify predictive variables Motivated by this limitation. we develop a new regularized algorithm. termed RSF-Variable Hunting This algorithm exploits maximal subtrees for effective variable selection under such scenarios Several applications are presented demonstrating the methodology. including the problem of gene selection using microarray data In this work we focus only on survival settings. although out methodology also applies to other random forests applications. including regression and classification settings All examples presented here use the R-software package randomSurvivalForest
Keywords:
Forest
Maximal subtree
Minimal depth
Random survival forest
Tree
VIMP
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
J
IF:
3
Papers:
5.1K
Citations:
4.8W
Organization
View more organizations