The partitioned LASSO-patternsearch algorithm with application to gene expression data

dc.contributor.authorShi, Weiliang
dc.contributor.authorWahba, Grace
dc.contributor.authorIrizarry, Rafael A
dc.contributor.authorCorrada Bravo, Hector
dc.contributor.authorWright, Stephen J
dc.date.accessioned2021-10-25T15:45:21Z
dc.date.available2021-10-25T15:45:21Z
dc.date.issued2012-05-15
dc.description.abstractIn systems biology, the task of reverse engineering gene pathways from data has been limited not just by the curse of dimensionality (the interaction space is huge) but also by systematic error in the data. The gene expression barcode reduces spurious association driven by batch effects and probe effects. The binary nature of the resulting expression calls lends itself perfectly to modern regularization approaches that thrive in high-dimensional settings. The Partitioned LASSO-Patternsearch algorithm is proposed to identify patterns of multiple dichotomous risk factors for outcomes of interest in genomic studies. A partitioning scheme is used to identify promising patterns by solving many LASSO-Patternsearch subproblems in parallel. All variables that survive this stage proceed to an aggregation stage where the most significant patterns are identified by solving a reduced LASSO-Patternsearch problem in just these variables. This approach was applied to genetic data sets with expression levels dichotomized by gene expression bar code. Most of the genes and second-order interactions thus selected and are known to be related to the outcomes. We demonstrate with simulations and data analyses that the proposed method not only selects variables and patterns more accurately, but also provides smaller models with better prediction accuracy, in comparison to several alternative methodologies.en_US
dc.description.urihttps://doi.org/10.1186/1471-2105-13-98
dc.identifierhttps://doi.org/10.13016/glwy-155v
dc.identifier.citationShi, W., Wahba, G., Irizarry, R.A. et al. The partitioned LASSO-patternsearch algorithm with application to gene expression data. BMC Bioinformatics 13, 98 (2012).en_US
dc.identifier.urihttp://hdl.handle.net/1903/28065
dc.language.isoen_USen_US
dc.publisherSpringer Natureen_US
dc.relation.isAvailableAtCollege of Computer, Mathematical & Physical Sciencesen_us
dc.relation.isAvailableAtDigital Repository at the University of Marylanden_us
dc.relation.isAvailableAtBiologyen_us
dc.relation.isAvailableAtUniversity of Maryland (College Park, MD)en_us
dc.subjectPenalty Parameteren_US
dc.subjectLogit Functionen_US
dc.subjectScreen Stepen_US
dc.subjectTrue Patternen_US
dc.subjectParametric Logistic Regressionen_US
dc.titleThe partitioned LASSO-patternsearch algorithm with application to gene expression dataen_US
dc.typeArticleen_US

Files

Original bundle
Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
1471-2105-13-98.pdf
Size:
640.02 KB
Format:
Adobe Portable Document Format
Description:
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.57 KB
Format:
Item-specific license agreed upon to submission
Description: