Theoretical properties of Cook's PFC dimension reduction algorithm for linear regression

dc.creatorJohnson, Oliver
dc.date2008-06-25
dc.date2008-09-18
dc.date.accessioned2026-07-07T10:03:24Z
dc.date.available2026-07-07T10:03:24Z
dc.descriptionWe analyse the properties of the Principal Fitted Components (PFC) algorithm proposed by Cook. We derive theoretical properties of the resulting estimators, including sufficient conditions under which they are $\sqrt{n}$-consistent, and explain some of the simulation results given in Cook's paper. We use techniques from random matrix theory and perturbation theory. We argue that, under Cook's model at least, the PFC algorithm should outperform the Principal Components algorithm.
dc.descriptionPublished in at http://dx.doi.org/10.1214/08-EJS255 the Electronic Journal of Statistics (http://www.i-journals.org/ejs/) by the Institute of Mathematical Statistics (http://www.imstat.org)
dc.identifierhttps://arxiv.org/abs/0806.4120
dc.identifierhttp://arxiv.org/abs/0806.4120
dc.identifierElectronic Journal of Statistics 2008, Vol. 2, 807-828
dc.identifierdoi:10.1214/08-EJS255
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/169276
dc.subjectStatistics Theory
dc.subject62H10 (Primary) 62E20 (Secondary)
dc.titleTheoretical properties of Cook's PFC dimension reduction algorithm for linear regression
dc.typetext

Files

Collections