Journal
STATISTICS IN BIOSCIENCES
Volume 4, Issue 1, Pages 3-26Publisher
SPRINGER
DOI: 10.1007/s12561-011-9048-z
Keywords
Sparse CCA; Structured sparsity; Group structure; Network structure; Genome-wide association study; eQTL mapping; Optimization algorithm
Categories
Funding
- Div Of Information & Intelligent Systems
- Direct For Computer & Info Scie & Enginr [1116730, 1332109] Funding Source: National Science Foundation
Ask authors/readers for more resources
In this paper we develop an efficient optimization algorithm for solving canonical correlation analysis (CCA) with complex structured-sparsity-inducing penalties, including overlapping-group-lasso penalty and network-based fusion penalty. We apply the proposed algorithm to an important genome-wide association study problem, eQTL mapping. We show that, with the efficient optimization algorithm, one can easily incorporate rich structural information among genes into the sparse CCA framework, which improves the interpretability of the results obtained. Our optimization algorithm is based on a general excessive gap optimization framework and can scale up to millions of variables. We demonstrate the effectiveness of our algorithm on both simulated and real eQTL datasets.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available