Functional data analysis

Functional data analysis (FDA) is a branch of statistics that analyses data providing information about curves, surfaces or anything else varying over a continuum. In its most general form, under an FDA framework, each sample element of functional data is considered to be a random function. The physical continuum over which these functions are defined is often time, but may also be spatial location, wavelength, probability, etc. Intrinsically, functional data are infinite dimensional. The high intrinsic dimensionality of these data brings challenges for theory as well as computation, where these challenges vary with how the functional data were sampled. However, the high or infinite dimensional structure of the data is a rich source of information and there are many interesting challenges for research and data analysis.

History

Functional data analysis has roots going back to work by Grenander and Karhunen in the 1940s and 1950s.^[1][2][3][4] They considered the decomposition of square-integrable continuous time stochastic process into eigencomponents, now known as the Karhunen-Loève decomposition. A rigorous analysis of functional principal components analysis was done in the 1970s by Kleffe, Dauxois and Pousse including results about the asymptotic distribution of the eigenvalues.^[5][6] More recently in the 1990s and 2000s the field has focused more on applications and understanding the effects of dense and sparse observations schemes. The term "Functional Data Analysis" was coined by James O. Ramsay.^[7]

Mathematical formalism

Random functions can be viewed as random elements taking values in a Hilbert space, or as a stochastic process. The former is mathematically convenient, whereas the latter is somewhat more suitable from an applied perspective. These two approaches coincide if the random functions are continuous and a condition called mean-squared continuity is satisfied.^[8]

Hilbertian random variables

In the Hilbert space viewpoint, one considers an ${\displaystyle H}$-valued random element ${\displaystyle X}$, where ${\displaystyle H}$ is a separable Hilbert space such as the space of square-integrable functions ${\displaystyle L^{2}[0,1]}$. Under the integrability condition that ${\displaystyle \mathbb {E} \|X\|_{L^{2}}^{2}=\mathbb {E} (\int _{0}^{1}|X(t)|^{2}dt)<\infty }$, one can define the mean of ${\displaystyle X}$ as the unique element ${\displaystyle \mu \in H}$ satisfying

${\displaystyle \mathbb {E} \langle X,h\rangle =\langle \mu ,h\rangle ,\qquad h\in H.}$

This formulation is the Pettis integral but the mean can also be defined as Bochner integral ${\displaystyle \mu =\mathbb {E} X}$. Under the integrability condition that ${\displaystyle \mathbb {E} \|X\|_{L^{2}}^{2}}$ is finite, the covariance operator of ${\displaystyle X}$ is a linear operator ${\displaystyle {\mathcal {C}}:H\to H}$ that is uniquely defined by the relation

${\displaystyle {\mathcal {C}}h=\mathbb {E} [\langle h,X-\mu \rangle (X-\mu )],\qquad h\in H,}$

or, in tensor form, ${\displaystyle {\mathcal {C}}=\mathbb {E} [(X-\mu )\otimes (X-\mu )]}$. The spectral theorem allows to decompose ${\displaystyle X}$ as the Karhunen-Loève decomposition

${\displaystyle X=\mu +\sum _{i=1}^{\infty }\langle X,\varphi _{i}\rangle \varphi _{i},}$

where ${\displaystyle \varphi _{i}}$ are eigenvectors of ${\displaystyle {\mathcal {C}}}$, corresponding to the nonnegative eigenvalues of ${\displaystyle {\mathcal {C}}}$, in a non-increasing order. Truncating this infinite series to a finite order underpins functional principal component analysis.

Stochastic processes

The Hilbertian point of view is mathematically convenient, but abstract; the above considerations do not necessarily even view ${\displaystyle X}$ as a function at all, since common choices of ${\displaystyle H}$ like ${\displaystyle L^{2}[0,1]}$ and Sobolev spaces consist of equivalence classes, not functions. The stochastic process perspective views ${\displaystyle X}$ as a collection of random variables

${\displaystyle \{X(t)\}_{t\in [0,1]}}$

indexed by the unit interval (or more generally interval ${\displaystyle {\mathcal {T}}}$). The mean and covariance functions are defined in a pointwise manner as

${\displaystyle \mu (t)=\mathbb {E} X(t),\qquad \Sigma (s,t)={\textrm {Cov}}(X(s),X(t)),\qquad s,t\in [0,1]}$

(if ${\displaystyle \mathbb {E} [X(t)^{2}]<\infty }$ for all ${\displaystyle t\in [0,1]}$).

Under the mean square continuity, ${\displaystyle \mu }$ and ${\displaystyle \Sigma }$ are continuous functions and then the covariance function ${\displaystyle \Sigma }$ defines a covariance operator ${\displaystyle {\mathcal {C}}:H\to H}$ given by

$${\displaystyle ({\mathcal {C}}f)(t)=\int _{0}^{1}\Sigma (s,t)f(s)\,\mathrm {d} s.}$$

(1)

The spectral theorem applies to ${\displaystyle {\mathcal {C}}}$, yielding eigenpairs ${\displaystyle (\lambda _{j},\varphi _{j})}$, so that in tensor product notation ${\displaystyle {\mathcal {C}}}$ writes

${\displaystyle {\mathcal {C}}=\sum _{j=1}^{\infty }\lambda _{j}\varphi _{j}\otimes \varphi _{j}.}$

Moreover, since ${\displaystyle {\mathcal {C}}f}$ is continuous for all ${\displaystyle f\in H}$, all the ${\displaystyle \varphi _{j}}$ are continuous. Mercer's theorem then states that

${\displaystyle \sup _{s,t\in [0,1]}\left|\Sigma (s,t)-\sum _{j=1}^{K}\lambda _{j}\varphi _{j}(s)\varphi _{j}(t)\right|\to 0,\qquad K\to \infty .}$

Finally, under the extra assumption that ${\displaystyle X}$ has continuous sample paths, namely that with probability one, the random function ${\displaystyle X:[0,1]\to \mathbb {R} }$ is continuous, the Karhunen-Loève expansion above holds for ${\displaystyle X}$ and the Hilbert space machinery can be subsequently applied. Continuity of sample paths can be shown using Kolmogorov continuity theorem.

Functional data designs

Functional data are considered as realizations of a stochastic process ${\displaystyle X(t),\ t\in [0,1]}$ that is an ${\displaystyle L^{2}}$ process on a bounded and closed interval ${\displaystyle [0,1]}$ with mean function ${\displaystyle \mu (t)=\mathbb {E} (X(t))}$ and covariance function ${\displaystyle \Sigma (s,t)={\textrm {Cov}}(X(s),X(t))}$. The realizations of the process for the i-th subject is ${\displaystyle X_{i}(\cdot )}$, and the sample is assumed to consist of ${\displaystyle n}$ independent subjects. The sampling schedule may vary across subjects, denoted as ${\displaystyle T_{i1},...,T_{iN_{i}}}$ for the i-th subject. The corresponding i-th observation is denoted as ${\displaystyle {\textbf {X}}_{i}=(X_{i1},...,X_{iN_{i}})}$, where ${\displaystyle X_{ij}=X_{i}(T_{ij})}$. In addition, the measurement of ${\displaystyle X_{ij}}$ is assumed to have random noise ${\displaystyle \epsilon _{ij}}$ with ${\displaystyle \mathbb {E} (\epsilon _{ij})=0}$ and ${\displaystyle {\textrm {Var}}(\epsilon _{ij})=\sigma _{ij}^{2}}$, which are independent across ${\displaystyle i}$ and ${\displaystyle j}$.

1. Fully observed functions without noise at arbitrarily dense grid

Measurements ${\displaystyle Y_{it}=X_{i}(t)}$ available for all ${\displaystyle t\in {\mathcal {I}},\,i=1,\ldots ,n}$

Often unrealistic but mathematically convenient.

Real life example: Tecator spectral data.^[7]

2. Densely sampled functions with noisy measurements (dense design)

Measurements ${\displaystyle Y_{ij}=X_{i}(T_{ij})+\varepsilon _{ij}}$, where ${\displaystyle T_{ij}}$ are recorded on a regular grid,

${\displaystyle T_{i1},\ldots ,T_{iN_{i}}}$, and ${\displaystyle N_{i}\rightarrow \infty }$ applies to typical functional data.

Real life example: Berkeley Growth Study Data and Stock data

3. Sparsely sampled functions with noisy measurements (longitudinal data)

Measurements ${\displaystyle Y_{ij}=X_{i}(T_{ij})+\varepsilon _{ij}}$, where ${\displaystyle T_{ij}}$ are random times and their number ${\displaystyle N_{i}}$ per subject is random and finite.

Real life example: CD4 count data for AIDS patients.^[9]

Functional principal component analysis

Functional principal component analysis (FPCA) is the most prevalent tool in FDA, partly because FPCA facilitates dimension reduction of the inherently infinite-dimensional functional data to finite-dimensional random vector of scores. More specifically, dimension reduction is achieved by expanding the underlying observed random trajectories ${\displaystyle X_{i}(t)}$ in a functional basis consisting of the eigenfunctions of the covariance operator on ${\displaystyle X}$. Consider the covariance operator ${\displaystyle {\mathcal {C}}:L^{2}[0,1]\rightarrow L^{2}[0,1]}$ as in (1), which is a compact operator on Hilbert space.

By Mercer's theorem, the kernel of ${\displaystyle {\mathcal {C}}}$, i.e., the covariance function ${\displaystyle \Sigma (\cdot ,\cdot )}$, has spectral decomposition ${\displaystyle \Sigma (s,t)=\sum _{k=1}^{\infty }\lambda _{k}\varphi _{k}(s)\varphi _{k}(t)}$, where the series convergence is absolute and uniform, and ${\displaystyle \lambda _{k}}$ are real-valued nonnegative eigenvalues in descending order with the corresponding orthonormal eigenfunctions ${\displaystyle \varphi _{k}(t)}$ . By the Karhunen–Loève theorem, the FPCA expansion of an underlying random trajectory is ${\displaystyle X_{i}(t)=\mu (t)+\sum _{k=1}^{\infty }A_{ik}\varphi _{k}(t)}$, where ${\displaystyle A_{ik}=\int _{0}^{1}(X_{i}(t)-\mu (t))\varphi _{k}(t)dt}$ are the functional principal components (FPCs), sometimes referred to as scores. The Karhunen–Loève expansion facilitates dimension reduction in the sense that the partial sum converges uniformly, i.e., ${\displaystyle \sup _{t\in [0,1]}\mathbb {E} [X_{i}(t)-\mu (t)-\sum _{k=1}^{K}A_{ik}\varphi _{k}(t)]^{2}\rightarrow 0}$ as ${\displaystyle K\rightarrow \infty }$ and thus the partial sum with a large enough ${\displaystyle K}$ yields a good approximation to the infinite sum. Thereby, the information in ${\displaystyle X_{i}}$ is reduced from infinite dimensional to a ${\displaystyle K}$-dimensional vector ${\displaystyle A_{i}=(A_{i1},...,A_{iK})}$ with the approximated process：

$${\displaystyle X_{i}^{(K)}(t)=\mu (t)+\sum _{k=1}^{K}A_{ik}\varphi _{k}(t)}$$

(2)

Other popular bases include spline, Fourier series and wavelet bases. Important applications of FPCA include the modes of variation and functional principal component regression.

Functional linear regression models

Functional linear models can be viewed as an extension of the traditional multivariate linear models that associates vector responses with vector covariates. The traditional linear model with scalar response ${\displaystyle Y\in \mathbb {R} }$ and vector covariate ${\displaystyle X\in \mathbb {R} ^{p}}$ can be expressed as

$${\displaystyle Y=\beta _{0}+\langle X,\beta \rangle +\varepsilon =\beta _{0}+X_{1}\beta _{1}+\dots +X_{p}\beta _{p}+\varepsilon ,}$$

(3)

where ${\displaystyle \langle \cdot ,\cdot \rangle }$ denotes the inner product in Euclidean space, ${\displaystyle \beta _{0}\in \mathbb {R} }$ and ${\displaystyle \beta \in \mathbb {R} ^{p}}$ denote the regression coefficients, and ${\displaystyle \varepsilon }$ is a zero mean finite variance random error (noise). Functional linear models can be divided into two types based on the responses.

Functional regression models with scalar response

Replacing the vector covariate ${\displaystyle X}$ and the coefficient vector ${\displaystyle \beta }$ in model (3) by a centered functional covariate ${\displaystyle X^{c}(t)=X(t)-\mu (t)}$ and coefficient function ${\displaystyle \beta =\beta (t)}$ for ${\displaystyle t\in [0,1]}$ and replacing the inner product in Euclidean space by that in Hilbert space ${\displaystyle L^{2}}$, one arrives at the functional linear model

$${\displaystyle Y=\beta _{0}+\langle X^{c},\beta \rangle +\varepsilon =\beta _{0}+\int _{0}^{1}X^{c}(t)\beta (t)\,dt+\varepsilon .}$$

(4)

The simple functional linear model (4) can be extended to multiple functional covariates, ${\displaystyle \{X_{j}\}_{j=1}^{p}}$, also including additional vector covariates ${\displaystyle Z=(Z_{1},\cdots ,Z_{q})}$, where ${\displaystyle Z_{1}=1}$, by

$${\displaystyle Y=\langle Z,\theta \rangle +\sum _{j=1}^{p}\int _{0}^{1}X_{j}^{c}(t)\beta _{j}(t)\,dt+\varepsilon ,}$$

(5)

where ${\displaystyle \theta \in \mathbb {R^{q}} }$ is regression coefficient for ${\displaystyle Z}$, the domain of ${\displaystyle X_{j}}$ is ${\displaystyle [0,1]}$, ${\displaystyle X_{j}^{c}}$ is the centered functional covariate given by ${\displaystyle X_{j}^{c}(t)=X_{j}(t)-\mu _{j}(t)}$, and ${\displaystyle \beta _{j}}$ is regression coefficient function for ${\displaystyle X_{j}^{c}}$, for ${\displaystyle j=1,\ldots ,p}$. Models (4) and (5) have been studied extensively.^[10][11][12]

Functional regression models with functional response

Consider a functional response ${\displaystyle Y(s)}$ on ${\displaystyle [0,1]}$ and multiple functional covariates ${\displaystyle X_{j}(t)}$, ${\displaystyle t\in [0,1]}$, ${\displaystyle j=1,\ldots ,p}$. Two major models have been considered in this setup.^[13][7] One of these two models, generally referred to as functional linear model (FLM), can be written as:

$${\displaystyle Y(s)=\alpha _{0}(s)+\sum _{j=1}^{p}\int _{0}^{1}\alpha _{j}(s,t)X_{j}^{c}(t)\,dt+\varepsilon (s),\ {\text{for}}\ s\in [0,1]}$$

(6)

where ${\displaystyle \alpha _{0}(s)}$ is the functional intercept, for ${\displaystyle j=1,\ldots ,p}$ , ${\displaystyle X_{j}^{c}(t)=X_{j}(t)-\mu _{j}(t)}$ is a centered functional covariate on ${\displaystyle [0,1]}$, ${\displaystyle \alpha _{j}(s,t)}$ is the corresponding functional slopes with same domain, respectively, and ${\displaystyle \varepsilon (s)}$ is usually a random process with mean zero and finite variance.^[13] In this case, at any given time ${\displaystyle s\in [0,1]}$, the value of ${\displaystyle Y}$, i.e., ${\displaystyle Y(s)}$, depends on the entire trajectories of ${\displaystyle \{X_{j}(t)\}_{j=1}^{p}}$. Model (6) has been studied extensively.^{[14][15][16][17][18]}

Function-on-scalar regression

In particular, taking ${\displaystyle X_{j}(\cdot )}$ as a constant function yields a special case of model (6)

which is a functional linear model with functional responses and scalar covariates.

Concurrent regression models

This model is given by,

$${\displaystyle Y(s)=\beta _{0}(s)+\sum _{j=1}^{p}\beta _{j}(s)X_{j}(s)+\varepsilon (s),\ {\text{for}}\ s\in [0,1],}$$

(7)

where ${\displaystyle X_{1},\ldots ,X_{p}}$ are functional covariates on ${\displaystyle [0,1]}$, ${\displaystyle \beta _{0},\beta _{1},\ldots ,\beta _{p}}$ are the coefficient functions defined on the same interval and ${\displaystyle \varepsilon (s)}$ is usually assumed to be a random process with mean zero and finite variance.^[13] This model assumes that the value of ${\displaystyle Y(s)}$ depends on the current value of ${\displaystyle \{X_{j}(s)\}_{j=1}^{p}}$ only and not the history ${\displaystyle \{X_{j}(t):t\leq s\}_{j=1}^{p}}$ or future value. Hence, it is a "concurrent regression model", which is also referred as "varying-coefficient" model. Further, various estimation methods have been proposed.^{[19][20][21][22][23][24]}

Functional nonlinear regression models

Direct nonlinear extensions of the classical functional linear regression models (FLMs) still involve a linear predictor, but combine it with a nonlinear link function, analogous to the idea of generalized linear model from the conventional linear model. Developments towards fully nonparametric regression models for functional data encounter problems such as curse of dimensionality. In order to bypass the "curse" and the metric selection problem, we are motivated to consider nonlinear functional regression models, which are subject to some structural constraints but do not overly infringe flexibility. One desires models that retain polynomial rates of convergence, while being more flexible than, say, functional linear models. Such models are particularly useful when diagnostics for the functional linear model indicate lack of fit, which is often encountered in real life situations. In particular, functional polynomial models, functional single and multiple index models and functional additive models are three special cases of functional nonlinear regression models.

Functional polynomial regression models

Functional polynomial regression models may be viewed as a natural extension of the Functional Linear Models (FLMs) with scalar responses, analogous to extending linear regression model to polynomial regression model. For a scalar response ${\displaystyle Y}$ and a functional covariate ${\displaystyle X(\cdot )}$ with domain ${\displaystyle [0,1]}$ and the corresponding centered predictor processes ${\displaystyle X^{c}}$, the simplest and the most prominent member in the family of functional polynomial regression models is the quadratic functional regression^[25] given as follows,

where ${\displaystyle X^{c}(\cdot )=X(\cdot )-\mathbb {E} (X(\cdot ))}$ is the centered functional covariate, ${\displaystyle \alpha }$ is a scalar coefficient, ${\displaystyle \beta (\cdot )}$ and ${\displaystyle \gamma (\cdot ,\cdot )}$ are coefficient functions with domains ${\displaystyle [0,1]}$ and ${\displaystyle [0,1]\times [0,1]}$, respectively. In addition to the parameter function β that the above functional quadratic regression model shares with the FLM, it also features a parameter surface γ. By analogy to FLMs with scalar responses, estimation of functional polynomial models can be obtained through expanding both the centered covariate ${\displaystyle X^{c}}$ and the coefficient functions ${\displaystyle \beta }$ and ${\displaystyle \gamma }$ in an orthonormal basis.^[25][26]

Functional single and multiple index models

A functional multiple index model is given as below, with symbols having their usual meanings as formerly described,

Here g represents an (unknown) general smooth function defined on a p-dimensional domain. The case ${\displaystyle p=1}$ yields a functional single index model while multiple index models correspond to the case ${\displaystyle p>1}$. However, for ${\displaystyle p>1}$, this model is problematic due to curse of dimensionality. With ${\displaystyle p>1}$ and relatively small sample sizes, the estimator given by this model often has large variance.^[27][28]

Functional additive models (FAMs)

For a given orthonormal basis ${\displaystyle \{\phi _{k}\}_{k=1}^{\infty }}$ on ${\displaystyle L^{2}[0,1]}$, we can expand ${\displaystyle X^{c}(t)=\sum _{k=1}^{\infty }x_{k}\phi _{k}(t)}$ on the domain ${\displaystyle [0,1]}$.

A functional linear model with scalar responses (see (3)) can thus be written as follows,

One form of FAMs is obtained by replacing the linear function of ${\displaystyle x_{k}}$ in the above expression ( i.e., ${\displaystyle \beta _{k}x_{k}}$) by a general smooth function ${\displaystyle f_{k}}$, analogous to the extension of multiple linear regression models to additive models and is expressed as,where ${\displaystyle f_{k}}$ satisfies ${\displaystyle \mathbb {E} (f_{k}(x_{k}))=0}$ for ${\displaystyle k\in \mathbb {N} }$.^[13][7] This constraint on the general smooth functions ${\displaystyle f_{k}}$ ensures identifiability in the sense that the estimates of these additive component functions do not interfere with that of the intercept term ${\displaystyle \mathbb {E} (Y)}$. Another form of FAM is the continuously additive model,^[29] expressed as,for a bivariate smooth additive surface ${\displaystyle g:[0,1]\times \mathbb {R} \longrightarrow \mathbb {R} }$ which is required to satisfy ${\displaystyle \mathbb {E} [g(t,X(t))]=0}$ for all ${\displaystyle t\in [0,1]}$, in order to ensure identifiability.

Generalized functional linear model

An obvious and direct extension of FLMs with scalar responses (see (3)) is to add a link function leading to a generalized functional linear model (GFLM)^[30] in analogy to the generalized linear model (GLM). The three components of the GFLM are:

1. Linear predictor ${\displaystyle \eta =\beta _{0}+\int _{0}^{1}X^{c}(t)\beta (t)\,dt}$; [systematic component]
2. Variance function ${\displaystyle {\text{Var}}(Y|X)=V(\mu )}$, where ${\displaystyle \mu =\mathbb {E} (Y|X)}$ is the conditional mean; [random component]
3. Link function ${\displaystyle g}$ connecting the conditional mean ${\displaystyle \mu }$ and the linear predictor ${\displaystyle \eta }$ through ${\displaystyle \mu =g(\eta )}$. [systematic component]

Clustering and classification of functional data

For vector-valued multivariate data, k-means partitioning methods and hierarchical clustering are two main approaches. These classical clustering concepts for vector-valued multivariate data have been extended to functional data. For clustering of functional data, k-means clustering methods are more popular than hierarchical clustering methods. For k-means clustering on functional data, mean functions are usually regarded as the cluster centers. Covariance structures have also been taken into consideration.^[31] Besides k-means type clustering, functional clustering^[32] based on mixture models is also widely used in clustering vector-valued multivariate data and has been extended to functional data clustering.^{[33][34][35][36][37]} Furthermore, Bayesian hierarchical clustering also plays an important role in the development of model-based functional clustering.^{[38][39][40][41]}

Functional classification assigns a group membership to a new data object either based on functional regression or functional discriminant analysis. Functional data classification methods based on functional regression models use class levels as responses and the observed functional data and other covariates as predictors. For regression based functional classification models, functional generalized linear models or more specifically, functional binary regression, such as functional logistic regression for binary responses, are commonly used classification approaches. More generally, the generalized functional linear regression model based on the FPCA approach is used.^[42] Functional Linear Discriminant Analysis (FLDA) has also been considered as a classification method for functional data.^{[43][44][45][46][47]} Functional data classification involving density ratios has also been proposed.^[48] A study of the asymptotic behavior of the proposed classifiers in the large sample limit shows that under certain conditions the misclassification rate converges to zero, a phenomenon that has been referred to as "perfect classification".^[49]

Time warping

Motivations

In addition to amplitude variation,^[50] time variation may also be assumed to present in functional data. Time variation occurs when the subject-specific timing of certain events of interest varies among subjects. One classical example is the Berkeley Growth Study Data,^[51] where the amplitude variation is the growth rate and the time variation explains the difference in children's biological age at which the pubertal and the pre-pubertal growth spurt occurred. In the presence of time variation, the cross-sectional mean function may not be an efficient estimate as peaks and troughs are located randomly and thus meaningful signals may be distorted or hidden.

Time warping, also known as curve registration,^[52] curve alignment or time synchronization, aims to identify and separate amplitude variation and time variation. If both time and amplitude variation are present, then the observed functional data ${\displaystyle Y_{i}}$ can be modeled as ${\displaystyle Y_{i}(t)=X_{i}[h_{i}^{-1}(t)],t\in [0,1]}$, where ${\displaystyle X_{i}{\overset {iid}{\sim }}X}$ is a latent amplitude function and ${\displaystyle h_{i}{\overset {iid}{\sim }}h}$ is a latent time warping function that corresponds to a cumulative distribution function. The time warping functions ${\displaystyle h}$ are assumed to be invertible and to satisfy ${\displaystyle \mathbb {E} (h^{-1}(t))=t}$.

The simplest case of a family of warping functions to specify phase variation is linear transformation, that is ${\displaystyle h(t)=\delta +\gamma t}$, which warps the time of an underlying template function by subjected-specific shift and scale. More general class of warping functions includes diffeomorphisms of the domain to itself, that is, loosely speaking, a class of invertible functions that maps the compact domain to itself such that both the function and its inverse are smooth. The set of linear transformation is contained in the set of diffeomorphisms.^[53] One challenge in time warping is identifiability of amplitude and phase variation. Specific assumptions are required to break this non-identifiability.

Methods

Earlier approaches include dynamic time warping (DTW) used for applications such as speech recognition.^[54] Another traditional method for time warping is landmark registration,^[55][56] which aligns special features such as peak locations to an average location. Other relevant warping methods include pairwise warping,^[57] registration using ${\displaystyle {\mathcal {L}}^{2}}$ distance^[53] and elastic warping.^[58]

Dynamic time warping

The template function is determined through an iteration process, starting from cross-sectional mean, performing registration and recalculating the cross-sectional mean for the warped curves, expecting convergence after a few iterations. DTW minimizes a cost function through dynamic programming. Problems of non-smooth differentiable warps or greedy computation in DTW can be resolved by adding a regularization term to the cost function.

Landmark registration

Landmark registration (or feature alignment) assumes well-expressed features are present in all sample curves and uses the location of such features as a gold-standard. Special features such as peak or trough locations in functions or derivatives are aligned to their average locations on the template function.^[53] Then the warping function is introduced through a smooth transformation from the average location to the subject-specific locations. A problem of landmark registration is that the features may be missing or hard to identify due to the noise in the data.

Extensions

So far we considered scalar valued stochastic process, ${\displaystyle \{X(t)\}_{t\in {\mathcal {T}}}}$, defined on one dimensional time domain.

Multidimensional domain of ${\displaystyle X(\cdot )}$

The domain of ${\displaystyle X(\cdot )}$ can be in ${\displaystyle R^{p}}$, for example the data could be a sample of random surfaces.^[59][60]

Multivariate stochastic process

The range set of the stochastic process may be extended from ${\displaystyle R}$ to ${\displaystyle R^{p}}$^[61][62][63] and further to nonlinear manifolds,^[64] Hilbert spaces^[65] and eventually to metric spaces.^[59]

Python packages

There are Python packages to work with functional data, and its representation, perform exploratory analysis, or preprocessing, and among other tasks such as inference, classification, regression or clustering of functional data.

• scikit-fda

R packages

Some packages can handle functional data under both dense and longitudinal designs.

• fda^[7]
• refund
• fdapace^[17]
• FDboost
• classiFunc
• fda.usc
• dtw
• fdasrvf^[58]

See also

• Functional principal component analysis
• Karhunen–Loève theorem
• Modes of variation
• Functional regression
• Generalized functional linear model
• Stochastic processes
• Lp space
• Variance function

Further reading

• Ramsay, J. O. and Silverman, B.W. (2005) Functional data analysis, 2nd ed., New York: Springer, ISBN 0-387-40080-X
• Horvath, L. and Kokoszka, P. (2012) Inference for Functional Data with Applications, New York: Springer, ISBN 978-1-4614-3654-6
• Hsing, T. and Eubank, R. (2015) Theoretical Foundations of Functional Data Analysis, with an Introduction to Linear Operators, Wiley series in probability and statistics, John Wiley & Sons, Ltd, ISBN 978-0-470-01691-6
• Morris, J. (2015) Functional Regression, Annual Review of Statistics and Its Application, Vol. 2, 321 - 359, https://doi.org/10.1146/annurev-statistics-010814-020413
• Wang et al. (2016) Functional Data Analysis, Annual Review of Statistics and Its Application, Vol. 3, 257-295, https://doi.org/10.1146/annurev-statistics-041715-033624

Category:Regression analysis

References