期刊
COMPUTATIONAL STATISTICS & DATA ANALYSIS
卷 71, 期 -, 页码 771-786出版社
ELSEVIER
DOI: 10.1016/j.csda.2013.06.004
关键词
Sparse group lasso; Classification; High dimensional data analysis; Coordinate gradient descent; Penalized loss
The sparse group lasso optimization problem is solved using a coordinate gradient descent algorithm. The algorithm is applicable to a broad class of convex loss functions. Convergence of the algorithm is established, and the algorithm is used to investigate the performance of the multinomial sparse group lasso classifier. On three different real data examples the multinomial group lasso clearly outperforms multinomial lasso in terms of achieved classification error rate and in terms of including fewer features for the classification. An implementation of the multinomial sparse group lasso algorithm is available in the R package msg1. Its performance scales well with the problem size as illustrated by one of the examples considered-a 50 class classification problem with 10 k features, which amounts to estimating 500 k parameters. (C) 2013 Elsevier B.V. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据