Shevade S K, Keerthi S S
Department of Computer Science and Automation, Indian Institute of Science, Bangalore 560012, India.
Bioinformatics. 2003 Nov 22;19(17):2246-53. doi: 10.1093/bioinformatics/btg308.
This paper gives a new and efficient algorithm for the sparse logistic regression problem. The proposed algorithm is based on the Gauss-Seidel method and is asymptotically convergent. It is simple and extremely easy to implement; it neither uses any sophisticated mathematical programming software nor needs any matrix operations. It can be applied to a variety of real-world problems like identifying marker genes and building a classifier in the context of cancer diagnosis using microarray data.
The gene selection method suggested in this paper is demonstrated on two real-world data sets and the results were found to be consistent with the literature.
The implementation of this algorithm is available at the site http://guppy.mpe.nus.edu.sg/~mpessk/SparseLOGREG.shtml
Supplementary material is available at the site http://guppy.mpe.nus.edu.sg/~mpessk/SparseLOGREG.shtml
本文针对稀疏逻辑回归问题给出了一种新的高效算法。所提出的算法基于高斯 - 赛德尔方法,并且是渐近收敛的。它简单且极易实现;既不使用任何复杂的数学编程软件,也不需要任何矩阵运算。它可应用于各种实际问题,如在使用微阵列数据进行癌症诊断的背景下识别标记基因和构建分类器。
本文提出的基因选择方法在两个实际数据集上得到了验证,结果与文献一致。
该算法的实现可在网站http://guppy.mpe.nus.edu.sg/~mpessk/SparseLOGREG.shtml获取。
补充材料可在网站http://guppy.mpe.nus.edu.sg/~mpessk/SparseLOGREG.shtml获取。