APPLE: approximate path for penalized likelihood estimators

被引:6
作者
Yu, Yi [1 ]
Feng, Yang [2 ]
机构
[1] Fudan Univ, Sch Math Sci, Shanghai 200433, Peoples R China
[2] Columbia Univ, Dept Stat, New York, NY 10027 USA
基金
美国国家科学基金会;
关键词
APPLE; LASSO; MCP; Penalized likelihood estimator; Solution path; COORDINATE DESCENT ALGORITHMS; GENERALIZED LINEAR-MODELS; VARIABLE SELECTION; LOGISTIC-REGRESSION; LASSO; CLASSIFICATION; SPARSITY;
D O I
10.1007/s11222-013-9403-7
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
In high-dimensional data analysis, penalized likelihood estimators are shown to provide superior results in both variable selection and parameter estimation. A new algorithm, APPLE, is proposed for calculating the Approximate Path for Penalized Likelihood Estimators. Both convex penalties (such as LASSO) and folded concave penalties (such as MCP) are considered. APPLE efficiently computes the solution path for the penalized likelihood estimator using a hybrid of the modified predictor-corrector method and the coordinate-descent algorithm. APPLE is compared with several well-known packages via simulation and analysis of two gene expression data sets.
引用
收藏
页码:803 / 819
页数:17
相关论文
共 40 条