JSM 2004 - Toronto

Abstract #300116

This is the preliminary program for the 2004 Joint Statistical Meetings in Toronto, Canada. Currently included in this program is the "technical" program, schedule of invited, topic contributed, regular contributed and poster sessions; Continuing Education courses (August 7-10, 2004); and Committee and Business Meetings. This on-line program will be updated frequently to reflect the most current revisions.

To View the Program:
You may choose to view all activities of the program or just parts of it at any one time. All activities are arranged by date and time.

The views expressed here are those of the individual authors
and not necessarily those of the ASA or its board, officers, or staff.


Back to main JSM 2004 Program page



Activity Number: 175
Type: Invited
Date/Time: Tuesday, August 10, 2004 : 8:30 AM to 10:20 AM
Sponsor: Section on Statistical Computing
Abstract - #300116
Title: Variable Selection for Survival Data Analysis
Author(s): Runze Li*+ and Jianwen Cai and Jianqing Fan and Haibo Zhou
Companies: Pennsylvania State University and University of North Carolina, Chapel Hill and Princeton University and University of North Carolina, Chapel Hill
Address: Dept. of Statistics, University Park, PA, 16802-2111,
Keywords: penalized likelihood ; SCAD
Abstract:

In most model selection problems, the number of parameters may be large, and grows as the sample size increases. I propose a penalized-likelihood method for variable selection with survival data analysis with growing number of regression coefficients. Under certain regularity conditions, we show the consistency and asymptotic normality of the penalized-likelihood estimators. We further demonstrate that, for certain penalty functions with proper choices of regularization parameters, the resulting estimate possesses an oracle property, namely, the resulting estimate can correctly identify the true model as if the true model (the subset of variables with nonvanishing coefficients) were known in advance. Using a simple approximation of the penalty function, the proposed method can be easily carried out with the Newton-Raphson algorithm. We conduct extensive Monte Carlo simulation studies to assess the finite sample performance of the proposed procedures. We illustrate the proposed method by analyzing a real dataset.


  • 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 2004 program

JSM 2004 For information, contact jsm@amstat.org or phone (888) 231-3473. If you have questions about the Continuing Education program, please contact the Education Department.
Revised March 2004