Premium
Components and completion of partially observed functional data
Author(s) -
Kraus David
Publication year - 2015
Publication title -
journal of the royal statistical society: series b (statistical methodology)
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 6.523
H-Index - 137
eISSN - 1467-9868
pISSN - 1369-7412
DOI - 10.1111/rssb.12087
Subject(s) - functional data analysis , functional principal component analysis , principal component analysis , regularization (linguistics) , covariance , missing data , computer science , mathematics , mathematical proof , domain (mathematical analysis) , set (abstract data type) , algorithm , function (biology) , artificial intelligence , statistics , machine learning , mathematical analysis , geometry , evolutionary biology , biology , programming language
Summary Functional data are traditionally assumed to be observed on the same domain. Motivated by a data set of heart rate temporal profiles, we develop methodology for the analysis of incomplete functional samples where each curve may be observed on a subset of the domain and unobserved elsewhere. We formalize this observation regime and develop the fundamental procedures of functional data analysis for this framework: estimation of parameters (mean and covariance operator) and principal component analysis. Principal scores of a partially observed function cannot be computed directly and we solve this challenging issue by estimating their best predictions as linear functionals of the observed part of the trajectory. Next, we propose a functional completion procedure that recovers the missing part by using the observed part of the curve. We construct prediction intervals for principal scores and bands for missing parts of trajectories. The prediction problems are seen to be ill‐posed inverse problems; regularization techniques are used to obtain a stable solution. A simulation study shows the good performance of our methods. We illustrate the methods on the heart rate data and provide practical computational algorithms and theoretical arguments and proofs of all results.