Two existing approaches to functional principal components analysis (FPCA) are due to Rice and Silverman (1991) and Silverman (1996), both based on maximizing variance but introducing penalization in different ways. In this article we propose an alternative approach to FPCA using penalized rank one approximation to the data matrix. Our contributions are four-fold: (1) by considering invariance under scale transformation of the measurements, the new formulation sheds light on how regularization should be performed for FPCA and suggests an efficient power algorithm for computation; (2) it naturally incorporates spline smoothing of discretized functional data; (3) the connection with smoothing splines also facilitates construction of cross-val...
This master thesis discusses selected topics of Functional Data Analysis (FDA). FDA deals with the r...
Kauermann G, Wegener M. Functional variance estimation using penalized splines with principal compon...
In this thesis we develop some new techniques for computing smooth and meanwhile locally sparse (i.e...
Two existing approaches to functional principal components analysis (FPCA) are due to Rice and Silve...
Two existing approaches to functional principal components analysis (FPCA) are due to Rice and Silve...
Functional principal component analysis (FPCA) is a dimension reduction technique that explains the ...
IPS005: Recent Advances in Functional Data AnalysisPrincipal component analysis (PCA) is an importan...
Computing estimates in functional principal component analysis (FPCA) from discrete data is usually...
<p>Principal component analysis (PCA) is an important tool for dimension reduction in multivariate a...
In functional principal component analysis (PCA), we treat the data that consist of functions not of...
AbstractPrincipal component analysis (PCA) is one of the key techniques in functional data analysis....
The problem of multicollinearity associated with the estimation of a functional logit model can be s...
This thesis presents three novel statistical methods for the robust analysis of functional data and ...
Functional principal component analysis has become the most important dimension reduction technique ...
We consider the robust principal component analysis (RPCA) problem where the observed data is decomp...
This master thesis discusses selected topics of Functional Data Analysis (FDA). FDA deals with the r...
Kauermann G, Wegener M. Functional variance estimation using penalized splines with principal compon...
In this thesis we develop some new techniques for computing smooth and meanwhile locally sparse (i.e...
Two existing approaches to functional principal components analysis (FPCA) are due to Rice and Silve...
Two existing approaches to functional principal components analysis (FPCA) are due to Rice and Silve...
Functional principal component analysis (FPCA) is a dimension reduction technique that explains the ...
IPS005: Recent Advances in Functional Data AnalysisPrincipal component analysis (PCA) is an importan...
Computing estimates in functional principal component analysis (FPCA) from discrete data is usually...
<p>Principal component analysis (PCA) is an important tool for dimension reduction in multivariate a...
In functional principal component analysis (PCA), we treat the data that consist of functions not of...
AbstractPrincipal component analysis (PCA) is one of the key techniques in functional data analysis....
The problem of multicollinearity associated with the estimation of a functional logit model can be s...
This thesis presents three novel statistical methods for the robust analysis of functional data and ...
Functional principal component analysis has become the most important dimension reduction technique ...
We consider the robust principal component analysis (RPCA) problem where the observed data is decomp...
This master thesis discusses selected topics of Functional Data Analysis (FDA). FDA deals with the r...
Kauermann G, Wegener M. Functional variance estimation using penalized splines with principal compon...
In this thesis we develop some new techniques for computing smooth and meanwhile locally sparse (i.e...