Shevade, SK and Keerthi, SS (2003) A simple and efficient algorithm for gene selection using sparse logistic regression. In: Bioinformatics, 19 (17). pp. 2246-2253.
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 Contact: firstname.lastname@example.org Supplementary Information: Supplementary material is available at the site http://guppy.mpe.nus.edu.sg/~mpessk/SparseLOGREG.shtml
|Item Type:||Journal Article|
|Additional Information:||The Copyright belongs to Oxford University Press.|
|Department/Centre:||Division of Electrical Sciences > Computer Science & Automation (Formerly, School of Automation)|
|Date Deposited:||19 Apr 2006|
|Last Modified:||19 Sep 2010 04:25|
Actions (login required)