The partitioned LASSO-patternsearch algorithm with application to gene expression data
1 Sanofi–Aventis, Cambridge, Massachusetts, USA
2 Department of Statistics, University of Wisconsin-Madison, Madison, Wisconsin, USA
3 Department of Biostatistics, Johns Hopkins University, Baltimore, Maryland, USA
4 Center for Bioinformatics and Computational Biology, Computer Science Department, University of Maryland-College Park, College Park, Maryland, USA
5 Department of Computer Sciences, University of Wisconsin-Madison, Madison, Wisconsin, USA
Citation and License
BMC Bioinformatics 2012, 13:98 doi:10.1186/1471-2105-13-98Published: 15 May 2012
In 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.