Statistics in Biosciences

, Volume 4, Issue 1, pp 3–26

An Efficient Optimization Algorithm for Structured Sparse CCA, with Applications to eQTL Mapping


DOI: 10.1007/s12561-011-9048-z

Cite this article as:
Chen, X. & Liu, H. Stat Biosci (2012) 4: 3. doi:10.1007/s12561-011-9048-z


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.


Sparse CCA Structured sparsity Group structure Network structure Genome-wide association study eQTL mapping Optimization algorithm 

Copyright information

© International Chinese Statistical Association 2011

Authors and Affiliations

  1. 1.Machine Learning DepartmentCarnegie Mellon UniversityPittsburgUSA
  2. 2.Biostatistics Department, Computer Science DepartmentJohns Hopkins UniversityBaltimoreUSA

Personalised recommendations