This is the program for the 2010 Joint Statistical Meetings in Vancouver, British Columbia.

Abstract Details

Activity Number: 189
Type: Invited
Date/Time: Monday, August 2, 2010 : 10:30 AM to 12:20 PM
Sponsor: Section on Statistical Learning and Data Mining
Abstract - #308219
Title: Grouping Pursuit and Feature Selection Over a Graph
Author(s): Yunzhang Zhu*+ and Xiaotong Shen
Companies: University of Minnesota and University of Minnesota
Address: 313 Ford Hall, Minneapolis, MN, 55455 ,
Keywords: Gene networks ; large p but small n ; nonconvex regularizer ; supervised clustering

Low-dimensional structures such as sparseness or homogenous subgroups of predictors are useful in high-dimensional regression analysis. In this article, we identify the grouping structure with respect to the size of regression coefficients, while achieving sparseness of a model, where predictors correspond to nodes over an undirected graph representing prior knowledge about grouping, and edges for two connecting nodes indicate that grouping is likely between them. This is motivated from gene networks, where genes tend to work in groups according to their biological functionalities. Through the method of non-convex regularization, we develop computational tools and study theoretical result for the proposed method. Both simulation studies and theoretical results show that the true underlying model can be recovered through our method. An application to gene network data will be discussed.

The address information is for the authors that have a + after their name.
Authors who are presenting talks have a * after their name.

Back to the full JSM 2010 program

2010 JSM Online Program Home

For information, contact or phone (888) 231-3473.

If you have questions about the Continuing Education program, please contact the Education Department.