.png){kind=icon}
返回
High-Dimensional Variable Selection for Survival Data
.png){kind=icon}
PRE
AI
DOI：10.1198/jasa.2009.tm08622.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
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
Keyword:
Forest
Maximal subtree
Minimal depth
Random survival forest
Tree
VIMP
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
J
IF:
3
论文数:
5.2K
被引数:
4.8W
机构
引用论文
A numerical solution of the multidimensional solidification (or melting) problem多维凝固 (或熔化) 问题的数值解
.png){kind=icon}
PREAI
分享收藏Local structural change in GaCrN grown by radio frequency plasma-assisted molecular-beam epitaxy
PREAI
分享收藏
查看更多内容