期刊
JOURNAL OF THE AMERICAN STATISTICAL ASSOCIATION
卷 105, 期 489, 页码 205-217出版社
TAYLOR & FRANCIS INC
DOI: 10.1198/jasa.2009.tm08622
关键词
Forest; Maximal subtree; Minimal depth; Random survival forest; Tree; VIMP
资金
- National Heart. Lung. and Blood Institute [CAN 8324207]
- Department of Defense [BC085325]
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
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据