STOR Colloquium: Peng Zeng (Auburn University)
Wednesday Apr 11, 2012
from 04:00 pm to 05:00 pm
|Where||120 Hanes Hall|
|Add event to calendar||
Linearly Constrained Lasso with Application in Glioblastoma Data
The knowledge and information on cancer is continuously accumulated as the advances in cancer research. How to appropriately incorporate them in data analysis to obtain more meaningful results presents a challenge to the statistical society. In this talk, we are concentrated in Glioblastoma, a most common and aggressive brain cancer. The objective is to identify genes that are related to Glioblastoma with incorporating the information on genetic pathways. The problem is formulated as a linearly constrained lasso problem. In general we have a lasso-type problem with linear equality and inequality constraints. We develop a solution path algorithm to fit this model efficiently, and also work out some asymptotic properties to understand its advantages. The method is proven to be efficient and flexible as demonstrated in simulation studies and real data analysis.
Refreshments will be served at 3:30pm in the 3rd floor lounge of Hanes Hall