A simple and efficient algorithm for gene selection using sparse logistic regression

Motivation: 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...

Full description

Saved in:
Bibliographic Details
Published inBioinformatics Vol. 19; no. 17; pp. 2246 - 2253
Main Authors Shevade, S. K., Keerthi, S. S.
Format Journal Article
LanguageEnglish
Published Oxford Oxford University Press 22.11.2003
Oxford Publishing Limited (England)
Subjects
Online AccessGet full text

Cover

Loading…
More Information
Summary:Motivation: 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. Results: 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. Availability: The implementation of this algorithm is available at the site http://guppy.mpe.nus.edu.sg/~mpessk/SparseLOGREG.shtml Supplementary Information: Supplementary material is available at the site http://guppy.mpe.nus.edu.sg/~mpessk/SparseLOGREG.shtml
Bibliography:local:btg308
ark:/67375/HXZ-T2WS2WC2-P
istex:25487D714B8DACA341D4EA6A8851F9B38F2E787F
Contact: mpessk@nus.edu.sg
ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ObjectType-Article-1
ObjectType-Feature-2
ISSN:1367-4803
1460-2059
1367-4811
DOI:10.1093/bioinformatics/btg308