12.07.2015 Views

Jolliffe I. Principal Component Analysis (2ed., Springer, 2002)(518s)

Jolliffe I. Principal Component Analysis (2ed., Springer, 2002)(518s)

Jolliffe I. Principal Component Analysis (2ed., Springer, 2002)(518s)

SHOW MORE
SHOW LESS
  • No tags were found...

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

12.3. Functional PCA 325subject to ∫ a 2 (t)dt = 1, where λ is a tuning parameter. Taking λ =0simply gives unsmoothed FPCA; as λ increases, so does the smoothnessof the optimal a(t). Ramsay and Silverman (1997, Section 7.3) show thatsolving the optimization problem reduces to solving the eigenequation∫S(s, t)a(t)dt = l(1 + λD 4 )a(s), (12.3.5)where D 4 a(s) is the fourth derivative of a(s). In their Section 7.4 they givesome computational methods for (approximately) solving equation (12.3.5),with the choice of λ discussed in Section 7.5. Minimizing (12.3.4) by solving(12.3.5) implies a form of orthogonality between successive a k (t) that isdifferent from the usual one. Ocaña et al. (1999) interpret this as a differentchoice of norm and inner product, and discuss the choice of norm in FPCAfrom a theoretical point of view. If (12.3.5) is solved by using basis functionsfor the data, the number of basis functions and the smoothing parameterλ both need to be chosen. Ratcliffe and Solo (1998) address the problemof choosing both simultaneously and propose an improved cross-validationprocedure for doing so.An alternative to incorporating smoothing directly into FPCA is tosmooth the data first and then conduct unsmoothed FPCA on thesmoothed curves. The smoothing step uses the well-known idea of minimizingthe sum of squares between fitted and observed curves, supplementedby a penalty function based on lack of smoothness (a roughness penalty).The quantity we wish to minimize can be written succicntly as‖x(t) − ˆx(t)‖ 2 + λ‖ˆx(t)‖ 2 , (12.3.6)where x(t), ˆx(t) denote observed and fitted curves, respectively, ‖ . ‖ denotesan appropriately chosen norm, not necessarily the same in the twoparts of the expression, and λ is a tuning parameter. The second norm isoften related to the second derivative, D 2 [ˆx(t)], which is a commonly usedmeasure of roughness.Besse et al. (1997) use a similar approach in which they optimize a criterionwhich, like (12.3.6), is a sum of two terms, one a measure of fit and theother a roughness penalty with a tuning parameter λ. Besse et al.’s modelassumes that, apart from noise, the curves lie in a q-dimensional space.A version ˆR q of the criterion R q , suggested by Besse and de Falguerolles(1993) and discussed in Section 6.1.5, is minimized with respect to q andλ simultaneously. If smoothing of the data is done using splines, then thePCA on the resulting interpolated data is equivalent to a PCA on the originaldata, but with a different metric (Besse, 1988). We return to this topicin Section 14.2.2.A more complicated approach to smoothing followed by PCA, involvingdifferent smoothing parameters for different FPCs, is discussed by Ramsayand Silverman (1997, Section 7.8). Grambsch et al. (1995) also use asmoothing process—though a different one—for the data, followed by PCA

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!