Grace Wahba | PubMed Health

PubMed2003

Optimal spline smoothing of fMRI time series by generalized cross-validation.

Linear parametric regression models of fMRI time series have correlated residuals. One approach to address this problem is to condition the autocorrelation structure by temporal smoothing. Smoothing splines with the degree of smoothing selected by generalized cross-validation (GCV-spline) provide a method to find an optimal smoother for an fMRI time series. The purpose of this study was to determine if GCV-spline of fMRI time series yields unbiased variance estimates of linear regression model parameters. GCV-spline was evaluated with a real fMRI data set and bias of the variance estimator was computed for simulated time series with autocorrelation structures derived from fMRI data. This study only considered fMRI experimental designs of boxcar type. The results from the real data suggest that GCV-spline determines appropriate amounts of smoothing. The simulations show that the variance estimates are, on average, unbiased. The unbiased variance estimates come at some cost to signal detection efficiency. This study demonstrates that GCV-spline is an appropriate method for smoothing fMRI time series.

Bias↗

PubMed2002

Soft and hard classification by reproducing kernel Hilbert space methods.

Reproducing kernel Hilbert space (RKHS) methods provide a unified context for solving a wide variety of statistical modelling and function estimation problems. We consider two such problems: We are given a training set [yi, ti, i = 1, em leader, n], where yi is the response for the ith subject, and ti is a vector of attributes for this subject. The value of y(i) is a label that indicates which category it came from. For the first problem, we wish to build a model from the training set that assigns to each t in an attribute domain of interest an estimate of the probability pj(t) that a (future) subject with attribute vector t is in category j. The second problem is in some sense less ambitious; it is to build a model that assigns to each t a label, which classifies a future subject with that t into one of the categories or possibly "none of the above." The approach to the first of these two problems discussed here is a special case of what is known as penalized likelihood estimation. The approach to the second problem is known as the support vector machine. We also note some alternate but closely related approaches to the second problem. These approaches are all obtained as solutions to optimization problems in RKHS. Many other problems, in particular the solution of ill-posed inverse problems, can be obtained as solutions to optimization problems in RKHS and are mentioned in passing. We caution the reader that although a large literature exists in all of these topics, in this inaugural article we are selectively highlighting work of the author, former students, and other collaborators.

Classification↗