Next Article in Journal
On the Sampling Size for Inverse Sampling
Previous Article in Journal
Selected Payback Statistical Contributions to Matrix/Linear Algebra: Some Counterflowing Conceptualizations
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Conditional Kaplan–Meier Estimator with Functional Covariates for Time-to-Event Data

by
Sudaraka Tholkage
,
Qi Zheng
and
Karunarathna B. Kulasekera
*
Department of Bioinformatics & Biostatistics, University of Louisville, Louisville, KY 40202, USA
*
Author to whom correspondence should be addressed.
Stats 2022, 5(4), 1113-1129; https://doi.org/10.3390/stats5040066
Submission received: 3 October 2022 / Revised: 20 October 2022 / Accepted: 21 October 2022 / Published: 10 November 2022
(This article belongs to the Section Survival Analysis)

Abstract

:
Due to the wide availability of functional data from multiple disciplines, the studies of functional data analysis have become popular in the recent literature. However, the related development in censored survival data has been relatively sparse. In this work, we consider the problem of analyzing time-to-event data in the presence of functional predictors. We develop a conditional generalized Kaplan–Meier (KM) estimator that incorporates functional predictors using kernel weights and rigorously establishes its asymptotic properties. In addition, we propose to select the optimal bandwidth based on a time-dependent Brier score. We then carry out extensive numerical studies to examine the finite sample performance of the proposed functional KM estimator and bandwidth selector. We also illustrated the practical usage of our proposed method by using a data set from Alzheimer’s Disease Neuroimaging Initiative data.

1. Introduction

Technology development has greatly improved the ability to record and store complex data. In many scientific fields such as biomedical, economic, and environmental studies, sampled data are functions of certain index variables, such as time, location, and temperature over a continuum. For example, in optical spectrometric data collected to analyze different compounds in food samples, the intensity of light is a function of continuous wavelength (e.g., [1]); in speech recognition, human voices pronouncing certain words were digitized and recorded as a function of time (e.g., [2]). In [3], the NOx level in the air is measured over a day near an industrial area. For more examples of function data, we refer readers to [4].
Let { X ( s ) , s S } denote a functional variable, where s is some index variable on a continuum S . However, in practice, due to limitations of measurement and storage, X ( s ) is usually collected only on a grid G S = { s 1 , , s p } over S . Therefore, the measured data are often in the form of discretized vectors ( X ( s 1 ) , X ( s 2 ) , , X ( s p ) ) T . When the grid G S is fine, the covariate vector closely resembles a smooth curve of X ( s ) .
Although function data are commonly represented by vectors, they are inherently different from ordinary multivariate vectors due to the temporal/spatial intercorrelation between consecutive entries. As a result, direct use of traditional multivariate statistical methods inevitably faces the difficulty of multicollinearity and, therefore, may not produce reliable results (see, e.g., [4]). Motivated by this, enormous efforts have been devoted to developing statistical tools for functional data analysis. For instance, Ref. [5] considered the generalized functional linear models with functional covariates; Ref. [6] developed functional principal component analysis (FPCA); refs. [7,8,9,10] investigated functional B-splines regression methods; refs. [11,12] studied nonparametric kernel methods.
In biomedical applications, there is also a plethora of available functional data, such as the cornea images in ophthalmology [13], the magnetic resonance imaging in the studies of Alzheimer’s Disease [14], the electroencephalography in psychiatry [15], and the electrocardiograms in cardiology [16]. In many of those studies, the response variable of primary interest is the time-to-event measurement in the presence of censoring. For example, ref. [17] investigated multiple myeloma patients’ disease-free survival against absolute lymphocyte cell counts, which were measured as a function of time. Ref. [18] examined the association between the post-hospital mortality of patients who suffer from acute lung injury/respiratory distress syndrome and the sequential organ failure assessment score as a function of ICU time.
However, the related development for the time-to-event measurement subject to censoring has been relatively sparse in functional data analysis. Ref. [6] proposed a functional censored regression model coupled with an EM algorithm introduced by [19] to assess the expected survival time. Ref. [20] incorporated functional covariates as longitudinal covariates and developed time varying functional principal component scores for predicting age-at-death distributions. However, their method does not account for censoring. Ref. [18] developed a penalized signal regression for mixed effect proportional hazard models. Ref. [14] utilized FPCA and introduced a functional linear cox regression Model (FLCRM).
Kaplan–Meier (KM) estimator proposed by [21] has been a popular method in time-to-event data (see, e.g., [22,23,24]), as it is a nonparametric approach without stringent model assumptions and describes the survival probabilities directly. KM estimator has also been used in functional data. For example, Ref. [25] employed it to estimate the extreme quantiles. However, to the best of our knowledge, the asymptotic properties of the functional KM estimator have not been thoroughly investigated, and thus the procedures built upon it lack theoretical guarantees. In this paper, we attempt to meet this challenge by developing a generalized conditional KM estimator with desirable asymptotic properties for functional data. We also develop a bandwidth selection approach based on time-dependent Brier scores [26,27] so that users can confidently apply our proposed estimator to study functional time-to-event data.
The remainder of this paper is organized as follows. Section 2 discusses the model setup and develops the functional KM estimator. We provide theoretical properties, including consistency and asymptotic normality of the proposed estimator in Section 3. In Section 4, we conduct extensive numerical studies to examine the finite sample performance of the proposed method. Section 5 illustrates the practical use of our proposed approach through a case study on Alzheimer’s Disease Neuroimaging Initiative Data. Section 6 provides a discussion and some concluding remarks. All proofs are relegated to the Appendix A.

2. Model Setup and Estimation Method

We begin with introducing some notations to present our proposed procedure. For generic variables U and V, let F U ( · ) and S U ( · ) = 1 F U ( · ) denote the cumulative distribution function and the survival function of U, respectively. Additionally, F U ( · | V ) and S U ( · | V ) denote the conditional cumulative distribution and survival functions, respectively, of U given V. Moreover, the conditional hazard and cumulative hazard functions of U given V are denoted by λ U ( · | V ) and Λ U ( · | V ) , respectively. We denote the L 2 norm of a functional covaraite x by x and denote the cardinality of a set A by | A | . Given two sequences s 1 n and s 2 n , we use the notation s 1 n s 2 n to denote s 1 n = O ( s 2 n ) and s 2 n = O ( s 1 n ) .

2.1. The Proposed Method

In this section, we describe the proposed procedure for estimating S T ( · | X ) , where T is the time-to-event of interest, subject to the right censoring by C and X = ( X ( 1 ) ( s ) , , X ( p ) ( s ) ) T , s S is a p-dimensional vector of functional covariates corresponding to the patient. Without loss of generality, we assume that S = [ 0 , 1 ] . Here, any scalar covariate Z can also be represented as a constant function Z ( s ) = Z , s S . For the simplicity of presentation, we only consider X = X ( s ) , s S as a 1-dimensional functional covariate in this work. However, the proposed method can be readily applied to scenarios with p > 1 , as demonstrated in our numerical analysis. Throughout the rest of this paper, we may write the functional covariate X ( s ) , s S as X for simplicity in notation when there is no confusion. We also denote the functional space of X by X .
Let Y = min { T , C } and δ = 1 { T < C } be the observed outcome variable and the censoring indicator, respectively, where 1 { · } is an indicator function. The observed data consists of n i.i.d. replicates of ( Y , δ , X ) , denoted by { ( Y i , δ i , X i ) , i = 1 , , n } . Under the conditional independence between T and C given X, the conditional survival function of Y given X is S Y ( · | X ) = S T ( · | X ) S C ( · | X ) . By simple algebra,
Λ T ( t | X ) = log S T ( t | X ) = 0 t d S T ( u | X ) S T ( u | X ) = 0 t d H ( u | X ) S Y ( u | X ) ,
where H ( t | X ) = P ( Y t , δ = 1 | X ) is the sub-distribution of Y in the absence of censoring. As H ( · | X ) and S Y ( · | X ) in Equation (1) involve only the observed variables, we can estimate them by kernel-type methods (see, e.g., [28,29,30,31]).
A common approach to dealing with functional covariates is utilizing the Karhunen-Loève expansion (see, e.g., [14,32]). Namely, we first find L orthogonal basis functions defined on S and represent each X i ( · ) by scores { ξ i l , i = 1 , , n ; l = 1 , , L } obtained from projecting X i ( · ) onto the space generated by L basis functions. However, as L is required to increase with the sample size n [33], the typical kernel estimation based on ξ i l ’s would inevitably suffer from the curse of dimensionality and lead to inefficient estimation.
To overcome this challenge, we follow [12] and employ the functional kernel estimator directly. Let K ( · ) be some kernel function and h n be a sequence of positive real numbers. We may suppress the subscript of h n when there is no confusion. We obtain Nadaraya-Watson type weights { B n j ( x ) , j = 1 , , n , x X } as
B n j ( x ) = K ( h 1 X j x ) r = 1 n K ( h 1 X r x ) .
Subsequently, the kernel type estimators of H ( t | x ) and S Y ( t | x ) can be constructed as H ^ ( t | x ) = j = 1 n 1 { Y j t , δ j = 1 } B n j ( x ) and S ^ Y ( t | x ) = j = 1 n 1 { Y j t } B n j ( x ) , for x X . Given that the argument inside the kernel function K above is positive, K is typically an asymmetric probability density function. Following Dabrowska [34], Dabrowska [35], we acquire a natural estimator of Λ T ( · | x )
Λ ^ T ( t | x ) = 0 t d H ^ ( u | x ) S ^ Y ( u | x ) = j = 1 n 1 { Y j t , δ j = 1 } B n j ( x ) r = 1 n 1 { Y r Y j } B n r ( x ) ,
where the second equality follows from the fact that H ^ ( · | x ) and S ^ Y ( · | x ) are piece-wise constant functions that only jump at Y j ’s. Then by Equation (1), a generalized conditional KM estimator of S T ( t | x ) can be immediately obtained as
S ^ T ( t | x ) = j = 1 n exp 1 { Y j t , δ j = 1 } B n j ( x ) r = 1 n 1 { Y r Y j } B n r ( x ) , t Y ( n ) 0 , t > Y ( n )
Remark 1.
Our proposed method can also be applied to settings where multiple functional or regular covariates are present. Let Z denote an additional covariate. We can construct multi-dimensional Nadaraya-Watson type weights B n j ( x , z ) as
B n j ( x , z ) = K 1 ( h 1 1 | | X j x | | ) × K 2 ( h 2 1 | | Z j z | | ) j = 1 n K 1 ( h 1 1 | | X j x | | ) × K 2 ( h 2 1 | | Z j z | | ) ,
where K 1 is an asymmetric kernel, and K 2 is either an asymmetric kernel (can be K 1 ) in case Z is a functional covariate or a symmetric kernel in case Z is a scalar covariate. Here, h 1 and h 2 are the bandwidths associated, respectively. We can then obtain S ^ T ( t | x , z ) by replacing B n j ( x ) with B n j ( x , z ) in Equation (3). It should be noted that convergence rates are negatively impacted when we have a product weight such as the above.

2.2. Bandwidth Selection

It is well-known that bandwidth selection is crucial to the performance of kernel-type estimators (see, e.g., [12,36]). One appealing approach is to study the asymptotic properties of S ^ T ( t | x ) and derive the optimal bandwidth by minimizing the mean integrated squared errors [37]. However, it is very challenging to obtain a closed form of the asymptotic variance of a generalized KM estimator (see, e.g., [24]). We thus propose to select the optimal bandwidth by a data-driven m-fold cross validation as follows:
1.
Randomly split the index set { 1 , 2 , , n } into m equal-size blocks: I 1 , , I m . Let I k be the collection of indices that are not contained in I k .
2.
Given a bandwidth h, for each k = 1 , , m ,
(a)
obtain S ^ T ( t | x ) , the survival probability estimates, using the observations { ( Y i , δ i , X i ) , i I k } .
(b)
obtain the fitness score E k ( h ) for the estimates S ^ T ( t | x ) in 2(a) following certain model fitness metric E, based on the observations { ( Y i , δ i , X i ) , i I k } .
3.
Summarize the overall fitness as E A ( h ) = m 1 k = 1 m E k ( h ) .
4.
Choose h ^ = argmin h E A ( h ) as the selected bandwidth.
For survival data, many fitness metrics often used for model selection may not be suitable, as they fail to account for censoring. The concordance index [38] and time-dependent Brier scores [26,27] are commonly used to evaluate the fitness of survival models [39]. In this study, we chose to use the Brier score, which takes into account both discrimination and calibration to assess the model fitness. In contrast, the concordance index reflects only discrimination [40]. The estimated Brier scores of observations with indices in I k at time t can be obtained as follows:
B S ^ ( t ) = 1 | I k | i I k W ^ i ( t ) ( 1 { Y i > t } S ^ T ( t | X i ) ) 2 ,
where W ^ i ( t ) is the inverse probability censoring weight (IPCW) of subject i at time t, given by,
W ^ i ( t ) = 1 { Y i t , δ i = 1 } 1 S ^ C ( Y i | X i ) + 1 { Y i > t } 1 S ^ C ( t | X i ) .
S ^ C ( t | x ) in (5) is the estimated survival probability of C given X, which can be obtained by modifying (3). We further adopted a more general version of the IPCW Brier score [41] with | I k | in (4) replaced by W ^ i ( t ) . Now we can calculate the evaluation score E k ( h ) in step (2.b) by integrating the Brier scores over a range of t > 0 . Then following steps 3 and 4, we can select the optimal bandwidth.

3. Theoretical Properties

In this section, we establish the theoretical properties of the proposed conditional KM estimator. We begin with imposing the following technical conditions, which facilitate our theoretical derivations.
(C1)
Let T = [ 0 , τ ] for some constant τ > 0 . Given x X , let B ( x , ε ) = { x X , | | x x | | ε } be a ball being centered at x and of radius ε [11]. There exists some ε * , C > 0 , such that,
sup x X sup x 1 , x 2 B ( x , ε * ) sup t 1 , t 2 T | S T ( t 1 | x 1 ) S T ( t 2 | x 2 ) | C ( | | x 1 x 2 | | 2 + | t 1 t 2 | 2 ) .
(C2)
The kernel function K ( · ) > 0 is Lipschitz-continuous over its support [ 0 , 1 ] , satisfying 0 1 K ( v ) d v = 1 and 0 < inf v [ 0 , 1 ] K ( v ) sup v [ 0 , 1 ] K ( v ) < .
(C3)
Let ϕ x ( ε ) = P ( X B ( x , ε ) ) > 0 denote the probability that the functional variable X is in B ( x , ε ) . There exists a function ϕ ( · ) and constants C 1 , C 2 , A > 0 such that 0 < C 1 ϕ ( ε ) inf x X ϕ x ( ε ) sup x X ϕ x ( ε ) C 2 ϕ ( ε ) < , and ϕ ( ε ) < A , ε < ε * .
(C4)
Let ψ ( ε ) = log ( N ε ( X ) ) , where N ε ( X ) is the minimal number of B ( x , ε ) ’s to cover X . This is called the Kolmogorov’s ε -entropy of X [42]. For n large enough, ( log n ) 2 / ( n ϕ ( h ) ) < ψ ( log n / n ) < n ϕ ( h ) / log n and for some β > 1 ,
j = 1 j exp ( 1 β ) ψ log j j < .
The Lipschitz continuous condition (C1) has been widely adopted in the literature (see, e.g., [11,36]) to ensure the smoothness of functional operators. The conditions on kernel function in (C2) have been adopted in the functional nonparametric estimation literature [12,43]. K ( · ) is chosen to be an asymmetric kernel because X j x is always positive. The bounded support of K ( · ) and that K ( · ) is bounded away from 0 are technical conditions to simplify the theoretical derivations. In the numerical studies, we chose the asymmetric Gaussian kernel and the results showed that it works quite well.
Conditions (C3) and (C4) follow from Ferraty and Vieu [11] and Ferraty et al. [42]. They are needed to establish the uniform consistency of the proposed conditional KM estimator over X . ϕ ( ε ) in Condition (C3) controls the concentration of the probability measure of the functional variable X, which is related to all the asymptotic results in nonparametric statistics for functional variables. In Proposition 1, it can be seen that the more concentrated the random variable X, (the higher small ball probability function ϕ ( h ) ), the more efficient will be the estimator. We refer the readers to Section 13.2 of Ferraty and Vieu [11] for some commonly considered infinite dimensional examples. ψ ( ε ) in condition (C4) is a measure of the complexity of X . A larger ψ ( ε ) means that X is a more complex function space. Condition (C4) essentially requires X to have some suitable complexity so that local smoothing can be applied and the curse of dimensionality problem can be overcame [42]. The Kolmogorov’s ϵ -entropy is often used in dimensionality reduction problems (see, e.g., [44,45]). Condition (C4) is also often satisfied in practice. We refer the readers to Section 2 in Ferraty et al. [42] for some common examples where these two conditions are met.
We first establish the estimation consistency results for H ^ and S ^ Y .
Proposition 1.
Under Conditions (C1)–(C4), if h 0 and ( n ϕ ( h ) ) 1 log n 0 , then
sup x X sup t T | H ^ ( t | x ) H ( t | x ) | = O h 2 + ψ ( log n / n ) n ϕ ( h ) 1 / 2 a . s .
sup x X sup t T | S ^ Y ( t | x ) S Y ( t | x ) | = O h 2 + ψ ( log n / n ) n ϕ ( h ) 1 / 2 a . s .
If X is a compact set in R instead of a functional space and the density of X is bounded below and above, then ψ ( log / n ) log n and ϕ ( h ) h . Thus, Proposition 1 reduces to the results for the ordinary conditional KM estimator (see, e.g., [24,35]).
Next, we derive an almost sure representation for the cumulative hazard function Λ T ( t | x ) , in terms of a sum of independent random variables as follows.
Theorem 1.
Under the same conditions as in Theorem 1,
Λ ^ T ( t | x ) Λ T ( t | x ) = S T ( t | x ) 1 j = 1 n B n j ( x ) ξ ( Y j , δ j , t , x ) + O h 2 + ψ ( log n / n ) n ϕ x ( h ) 3 / 4 a . s . ,
where
ξ ( Y j , δ j , t , x ) = S T ( t | x ) 0 min { Y j , t } d H ( u | x ) S Y ( u | x ) 2 + 1 { Y j t , δ j = 1 } S Y ( Y j | x ) .
There are two remainder terms in Proposition 1, One of them, h 2 , is the bias term, and the other, ψ ( log n / n ) n ϕ x ( h ) 3 / 4 , is a dispersion component. Since they increase and decrease, respectively, as the bandwidth increases, we need to choose a suitable bandwidth to balance this trade-off. Noting that S ^ T ( t | x ) = exp ( Λ ^ T ( t | x ) ) , we can obtain the following corollary.
Corollary 1.
Under the same assumptions as in Theorem 1,
S ^ T ( t | x ) S T ( t | x ) = j = 1 n B n j ( x ) ξ ( Y j , δ j , t , x ) + O h 2 + ψ ( log n / n ) n ϕ x ( h ) 3 / 4 a . s .
Moreover, if n h 5 0 and n 1 h 2 ( ψ ( log n / n ) / ϕ x ( h ) ) 3 0 , x X ,
( n h ) 1 / 2 [ S ^ T ( t | x ) S T ( t | x ) ] d N ( 0 , V ( x , t ) )
for some variance function V ( x , t ) .
The form of V ( x , t ) is quite complicated and the estimation of V ( x , t ) is beyond the scope of this work.

4. Numerical Studies

In this section, we conduct extensive simulation studies to examine the finite sample performance of our proposed procedure. We consider the following four different scenarios.
  • Scenario 1: T ( X ) = 1 + 1 | X ( s ) | ( 1 cos ( π s ) ) d s + ϵ , where X ( s ) = sin ( ω s ) + ( A + 2 π ) s + B , s ( 1 , 1 ) , A , B Unif ( 0 , 1 ) , ω Unif ( 0 , 2 π ) , and ϵ N ( 0 , 2 ) distribution.
  • Scenario 2: T ( X ) = exp { ( 1 + 1 | X ( s ) | ( 1 cos ( π s ) ) d s + 2.5 Z + ϵ )/5}, where X ( s ) and ϵ are generated in the same way as in scenario 1, and Z follows a standard normal distribution.
  • Scenario 3: T ( X ) = 1 + 2.5 1 + 1 ( 1 cos ( π s ) ) d s + ϵ ., where X ( s ) and ϵ generated in the same way as in scenario 1.
  • Scenario 4: T ( X ) exp ( h ( t ) exp { 0 1 X ( s ) β ( s ) d s } ) , where h ( t ) = 1 , X ( s ) = U 1 + U 2 s + j = 1 10 [ ν j 1 sin { 2 ( 2 j 1 ) π s } + ν j 2 cos { 2 ( 2 j 1 ) π s } ] , with U 1 , U 2 N ( 0 , 1 ) , ν j 1 , ν j 2 N ( 0 , 1 / j ) , and β ( s ) = 0.6 [ sin ( π s ) cos ( π s ) + sin ( 3 π s / 10 ) cos ( 3 π s ) + sin ( 5 π s ) / 9 cos ( 5 π s ) / 9 + sin ( 7 π s ) / 16 cos ( 7 π s ) / 16 + sin ( 9 π s ) / 25 cos ( 9 π s ) / 25 + ( 2 π ) 1 / 2 exp { 2 1 ( s 0.5 ) 2 } ] for 0 s 1 .
Scenario 1 follows from [12], where the survival time depends on the functional covariates. In Scenario 2, we considered an accelerated failure time model with an extra covariate additional to functional covariates to elaborate what we discussed in Remark 1. Scenario 3 is considered to examine the performance of the proposed method when the survival time is independent of the covariates. Scenario 4 is a functional Cox regression model and was considered in [14]. It is worth mentioning that Scenarios 1 and 3 are still valid for survival data, since the time of event is extremely rarely negative.
The censoring time in each scenario was generated independently from a uniform distribution Unif ( 0 , c 0 ) , where c 0 is chosen to achieve the desired censoring rates of 15% and 25%, representing low and mild censoring, respectively. In addition, we consider two sample sizes n = 100 and 400, simulating the small and moderate sample sizes, respectively. Additional simulations with an even smaller sample size n = 50 are considered and discussed in the Appendix A. For each combination of scenario, censoring rate, and sample size, we generate 100 replications.
In each replication, we standardize functional covariates by first centering them according to their means and then scaling them by the standard deviation of their L 2 norms. The standardization of the covariates is critical for us to specify a uniform grid for bandwidth selection. We chose the kernel function K ( . ) to be the asymmetrical Gaussian kernel. To speed up locating the optimal bandwidth associated with the kernel function, we carried out a 2-fold search. We first considered a coarse grid of bandwidths, { 0.5 , 1 , , 20 } and selected a pilot bandwidth h ˜ , according to the procedure described in Section 2.2. Then we constructed a refined grid ( h ˜ 1 , h ˜ + 1 ) of size 20 to select the optimal bandwidth.
In Scenario 2, we consider an additional grid of bandwidths for the Gaussian kernel function associated with the scalar covariate, Z. According to the Silverman’s rule of thumb [46], the optimal choice is approximately 1.06 σ n 1 / 5 0.42 ( n = 100 ) . We thus consider a grid of bandwidths { 0.20 , 0.25 , , 1 } . We conduct the cross validation method in Section 2.2 to obtain a pair of optimal bandwidths for the two kernel functions simultaneously. In scenario 3, we only conducted the search on the coarse grid as we expect the bandwidth to be large.
To evaluate the performance of our proposed bandwidth selection procedure, we compare the selected bandwidth to a hypothetical one obtained by using the mean squared error (MSE)
MSE ( t ) = 1 m k = 1 m i I k [ S T ( t | X i ) S ^ T ( t | X i ) ] 2
as the fitness metric E in our proposed cross validation procedure in Section 2.2. This can be done since S T ( t | X ) is known in the simulations.
Figure 1 plots the average Brier score over 100 replications at different bandwidths against the bandwidth under four scenarios. The vertical lines in Figure 1 indicate the average optimal bandwidths selected from using Brier score (dotted) and MSE (dashed).
Figure 1 indicates a good performance of our proposed bandwidth selector. For scenarios 1, 2, and 4, it can be seen that the optimal bandwidth selected using the Brier score is close to the “oracle” optimal bandwidth selected based on the MSE, which assumes that the true conditional survival probabilities are known in advance. As the censorship rate decreases, the difference between the two selected bandwidths becomes smaller. In Scenario 3, since the survival time is independent of the covariates, the regular KM estimator should be used and the theoretical optimal bandwidth for our proposed conditional KM estimator is infinite so that all observations would be used to estimate the survival probability. Large bandwidths were selected by our proposed bandwidth selector as expected, and thus the resulting estimator would be similar to a regular Kaplan–Meier estimator.
We compare the proposed method to two benchmark methods: the regular KM estimator and the functional Cox method, FLCRM [14]. We considered the regular KM estimator for all scenarios and FLCRM for Scenario 4. The functional Cox regression model was implemented using the R codes provided by Kong et al. [14]. We assess the predictive performance of the three methods as follows: in each replication, we generate additional testing data set of sample size 100. For the proposed method, we compute S ^ T ( Y i | X i ) for each ( Y i , X i ) in the testing data, based on (3) using the training data and the selected optimal bandwidth from the training data set. Then we calculated the mean squared prediction error (MSPE) of the estimates as i = 1 100 ( S ^ T ( Y i | X i ) S T ( Y i | X i ) ) 2 / 100 . For the benchmark methods, we also obtained their corresponding predicted survival probabilities and MSPE. The summaries of the results are presented in Figure 2 and Table 1.
Figure 2 shows that for Scenarios 1, 2, and 4, the proposed method has comparatively lower MSPEs than the other methods. Furthermore, we can observe that the performance of the proposed estimator based on the bandwidth selected using the Brier score and “oracle” MSE (7) is comparable, confirming a good performance of our proposed bandwidth selector. Moreover, we note that as the sample size increases, the performance of our proposed conditional functional KM estimator enhances with lower MSPEs in all scenarios. On the contrary, the MSPE from the regular KM estimator does not necessarily get lower as the sample size increases. Table 1 shows that the MSPE of our conditional functional KM estimator decreases at a lower censoring rate, as expected. When the survival time is independent of covariates (Scenario 3), the regular KM estimator is expected to achieve the best performance. However, the proposed estimator performs on par with the regular KM estimator because our bandwidth selector chose a large bandwidth and the conditional KM estimator converges to KM estimator as the bandwidth increases. Therefore, regardless of the various scenarios considered in this study, we can claim that the proposed estimator performs the same or better than the comparison methods.

5. Application

In this section, we illustrate the practical use of our proposed method by analyzing Alzheimer’s Disease Neuroimaging Initiative (ADNI) data [14]. Alzheimer’s Disease (AD) is one of the most common causes of memory loss and dementia, affecting more than five million Americans. It is the 6th leading cause of death in the USA. It is a progressive disease. In earlier stages of the disease, the symptoms are mild, and the treatment is more likely to be beneficial as the symptoms gradually worsen over time. Therefore an earlier and more accurate diagnosis is one of the most critical goals in this area of research. The phase of mild cognitive impairment (MCI) is considered the initial stage of dementia, and the time that takes an individual to convert from MCI to AD is of primary interest in various studies (see, e.g., [47,48,49,50]).
The hippocampus is an area in the brain that is important for learning and memory. It is also vulnerable to affect at the early stage of AD. Multiple studies [51,52,53] have proposed to use hippocampal radial distances for studying the changes in the hippocampus of AD patients, as hippocampal radial distances are the distances between the medial core of the hippocampus and the corresponding vertex, and can reflect the hippocampal shape and size. This study uses the hippocampal radial distances of 30,000 surface points on the left and right hippocampal surfaces at baseline as functional covariates. We also consider the Alzheimer’s Disease Assessment Scale-Cognitive Subscale (ADAS-Cog) score as it was identified to be one of the most significant scalar covariates in predicting the time of conversion from MCI to AD in Kong et al. [14]. The data consist of 373 MCI patients, where 161 of them had developed AD before study completion.
The functional covariate (hippocampal radial distances) and the scalar covariate (ADAS-Cog score) were both scaled prior to the estimation. We split the data into a training and testing set. The training set contains 273 randomly chosen observations and was used to calculate the optimal bandwidth. The testing set is of sample size 100, to which we apply the proposed method and compare the performance of other methods considered in this work. To select the optimal bandwidths for the functional covariate and scalar covariate, we employed the same approach in Scenario 2 of our simulation studies and used the same grids of bandwidths for the functional and scalar covariates. The optimal bandwidths for the functional and scalar covariates were found to be 1.1 and 0.6, respectively. Then we computed the predicted survival probability for the testing data and subsequently obtained the Brier scores. To compare the performance of the proposed method, we also used FLCRM and regular KM methods to estimate the survival probabilities of the testing data and calculate their corresponding Brier scores. Noting that a smaller value of the Brier score indicates a more accurate estimation of survival probability, Figure 3 demonstrates that the performance of the proposed method is superior to the other two methods at most of the time points in the range of T. Furthermore, we estimated the area under the brier score curve (AUC) for each method. The proposed conditional functional KM has a significantly lower AUC (219.5) than FLCRM (326.7) and the regular KM method (418.7).

6. Discussion

Recent technological advancement has made functional data widely available in multiple disciplines, especially biomedical studies, where the response variable is often the time-to-event time in the presence of censoring. Therefore, it would be practically appealing to develop a conditional KM estimator that takes the functional covariates into account. In this paper, we rise to this challenge and propose a kernel-based conditional generalized KM estimator to analyze time-to-event data in the presence of functional covariates. We rigorously establish the proposed estimator’s asymptotic properties and develop a Brier scores-based bandwidth selector. The numerical studies in this paper evince the satisfactory performance of our proposed estimator when the functional covariate is present.
In this paper, we only considered the estimation of the survival probability using a conditional Kaplan–Meier estimator with functional covariates. It is also of interest to carry out inferences on the proposed estimator. We shall pursue this research direction by constructing the confidence intervals/bands, conducting a hypothesis test, and examining the empirical performance in our future research.
Moreover, Wang and Wang [54] and Leng and Tong [55] studied the weighted quantile regression for censored survival data with weights constructed from the conditional KM estimator. The quantile regression can accommodate and investigate the heterogeneous effects of covariates on survival time. It is possible to develop a quantile regression for functional covariates and examine their varying effects, which often entail significant practical implications (see, e.g., [56,57]). The detailed development is beyond the scope of this paper and will be studied in our forthcoming work.

Author Contributions

Conceptualization, Q.Z., K.B.K.; Formal analysis, S.T.; Methodology, S.T., Q.Z. and K.B.K.; Project administration, Q.Z.; Software, S.T.; Supervision, Q.Z.; Writing—original draft, S.T., Q.Z. and K.B.K.; Writing—review & editing, Q.Z. and K.B.K. All authors have read and agreed to the published version of the manuscript.

Funding

The work was partially supported by grants from NIH 1R03AG067611, 1R21AG070659 and NSF DMS1952486.

Data Availability Statement

Not applicable.

Conflicts of Interest

The authors declare no conflict of interest.

Appendix A

Let a n h 2 + ψ ( log n / n ) / ( n ϕ ( h ) ) 1 / 2 and b n a n 1 / 2 .
Proof of Proposition 1. 
Since the proofs of the consistency of S ^ Y and H ^ are similar, we only deal with S ^ Y . The proof follows from the standard arguments used in [35].
Since Y is completely observed, we can utilize the consistency of nonparametric functional estimator in Ferraty et al. [42]. According to Lemma 12 of [42], under (C1) and (C4), we have
sup x X sup t T | E ( S ^ Y ( t | x ) ) S Y ( t | x ) | = O ( h 2 ) .
Moreover, following Lemma 13 of [42], under (C1)–(C4), we can obtain,
sup x X sup t T | S ^ Y ( t | x ) E ( S ^ Y ( t | x ) ) | = O ψ ( log n / n ) n ϕ ( h ) a . s .
Combining the above two results together completes the proof of Proposition 1. □
Proof of Theorem 1. 
By simple algebra, we obtain the following decomposition:
Λ ^ T ( t | x ) Λ T ( t | x ) = ( j = 1 n 1 { y j t , δ j = 1 } B n j ( x ) 1 r = 1 n 1 { y r < y j } B n r ( x ) j = 1 n 1 { y j t , δ j = 1 } B n j ( x ) 1 r = 1 n 1 { y r y j } B n r ( x ) ) + 0 t d H ^ ( u | x ) S ^ Y ( u | x ) 0 t d H ( u | x ) S Y ( u | x ) = : I + I I
By Proposition 1 and the fact that sup j B n j ( x ) = O ( n 1 ϕ ( h ) 1 ) , we can write I as follows
I = j = 1 n 1 { y j t , δ j = 1 } B n j ( x ) 1 r = 1 n 1 { y r < y j } B n r ( x ) j = 1 n 1 { y j t , δ j = 1 } B n j ( x ) 1 r = 1 n 1 { y r y j } B n r ( x ) = j = 1 n 1 { y j t , δ j = 1 } B n j ( x ) [ r = 1 n 1 { y r < y j } B n r ( x ) r = 1 n 1 { y r y j } B n r ( x ) ] ( 1 r = 1 n 1 { y r < y j } B n r ( x ) ) ( 1 r = 1 n 1 { y r y j } B n r ( x ) ) = j = 1 n 1 { y j t , δ j = 1 } B n j ( x ) 2 ( 1 r = 1 n 1 { y r < y j } B n r ( x ) ) ( 1 r = 1 n 1 { y r y j } B n r ( x ) ) = O ( n 1 ϕ ( h ) 1 ) .
We now decompose I I into I I 1 + I I 2 , where
I I 1 = 0 t 1 S ^ Y ( u | x ) 1 S Y ( u | x ) d H ( u | x ) + 0 t 1 S Y ( u | x ) d ( H ^ ( u | x ) H ( u | x ) ) and I I 2 = 0 t 1 S ^ Y ( u | x ) 1 S Y ( u | x ) d ( H ^ ( u | x ) H ( u | x ) ) .
First, we deal with I I 1 .
I I 1 = 0 t 1 S Y ( u | x ) d ( H ^ ( u | x ) H ( u | x ) ) + 0 t S Y ( u | x ) S ^ Y ( u | x ) S Y 2 ( u | x ) ) d H ( u | x ) + 0 t S Y ( u | x ) S ^ Y ( u | x ) S Y ( u | x ) S ^ Y ( u | x ) S Y ( u | x ) S ^ Y ( u | x ) S Y 2 ( u | x ) d H ( u | x ) = 0 t S ^ Y ( u | x ) S Y 2 ( u | x ) d H ( u | x ) + j = 1 n 1 { y j t , δ j = 1 } B n j ( x ) S Y ( Y j | x ) + 0 t [ S Y ( u | x ) S ^ Y ( u | x ) ] 2 S Y 2 ( u | x ) S ^ Y ( u | x ) d H ( u | x ) = 0 t 1 j = 1 n 1 { Y j u } B n j ( x ) S Y 2 ( u | x ) d H ( u | x ) + j = 1 n 1 { y j t , δ j = 1 } B n j ( x ) S Y ( Y j | x ) + O ( a n 2 ) a . s ,
where the last equality follows from Proposition 1. Noting that j = 1 n B n j ( x ) = 1 , we have
I I 1 = 0 t j = 1 n B n j ( x ) j = 1 n B n j ( x ) 1 { Y j u } S Y 2 ( u | x ) d H ( u | x ) + j = 1 n B n j ( x ) 1 { y j t , δ j = 1 } S Y ( Y j | x ) + O ( a n 2 ) = 0 t j = 1 n B n j ( x ) 1 { Y j > u } S Y 2 ( u | x ) d H ( u | x ) + j = 1 n B n j ( x ) 1 { y j t , δ j = 1 } S Y ( Y j | x ) + O ( a n 2 ) = j = 1 n B n j ( x ) 0 t 1 { u < Y j } ( S Y ( u | x ) ) 2 d H ( u | x ) + j = 1 n B n j ( x ) 1 { y j t , δ j = 1 } S Y ( Y j | x ) + O ( a n 2 ) = j = 1 n B n j ( x ) 0 min { Y j , t } 1 ( S Y ( u | x ) ) 2 d H ( u | x ) + j = 1 n B n j ( x ) 1 { y j t , δ j = 1 } S Y ( Y j | x ) + O ( a n 2 ) = j = 1 n B n j ( x ) 0 min { Y j , t } d H ( u | x ) ( S Y ( u | x ) ) 2 + 1 { y j t , δ j = 1 } S Y ( Y j | x ) + O ( a n 2 ) = j = 1 n B n j ( x ) ξ ( Y j , δ j , t , x ) S T ( t | x ) + O ( a n 2 ) .
Next, we evaluate I I 2 . Let 0 = t 1 < t 2 < < t k n + 1 = t denote a partition for the interval [ 0 , t ] , where k n { [ ψ ( log n / n ) / ( n ϕ ( h ) ) ] 1 / 2 + h 2 } 1 . By integration by parts and Proposition 1,
I I 2 = 1 S ^ Y ( u | x ) 1 S Y ( u | x ) H ^ ( u | x ) H ( u | x ) ) | 0 t 0 t ( H ^ ( u | x ) H ( u | x ) ) d 1 S ^ Y ( u | x ) 1 S Y ( u | x ) . sup 0 u t 1 S ^ Y ( u | x ) 1 S Y ( u | x ) 1 i k n H ^ ( u | x ) H ( u | x ) | t i t i + 1 + sup 0 s t H ^ ( u | x ) H ( u | x ) 1 i k n t i t i + 1 d 1 S ^ Y ( u | x ) 1 S Y ( u | x ) k n O ( a n ) { max 1 i k n H ^ ( t i + 1 | x ) H ( t i + 1 | x ) H ^ ( t i | x ) + H ( t i | x ) + max 1 i k n sup y [ t i , t i + 1 ] 1 S ^ Y ( y | x ) 1 S Y ( y | x ) 1 S ^ Y ( t i | x ) + 1 S Y ( t i | x ) } .
According to Condition (C1), there exists a constant C 3 such that | S Y ( t i + 1 | x ) S Y ( t i | x ) | C 3 / k n . Now, divide each [ t i , t i + 1 ] into b n sub-intervals [ t i j , t i ( j + 1 ) ] , j = 1 , . . . , b n . Then we have, | S Y ( t i ( j + 1 ) | x ) S Y ( t i j | x ) | = O ( a n 3 / 2 ) . By Proposition 1, we get
sup 0 < t < τ sup x X | S ^ Y ( t | x ) S Y ( t | x ) | 2 = O ( a n 2 ) .
These two results and the monotonicity of S ^ Y ( t | x ) over t together yield that
sup y [ t i , t i + 1 ] 1 S ^ Y ( y | x ) 1 S Y ( y | x ) 1 S ^ Y ( t i | x ) + 1 S Y ( t i | x ) sup y [ t i , t i + 1 ] S ^ Y ( y | x ) S Y ( y | x ) S Y ( y | x ) 2 S ^ Y ( t i | x ) S Y ( t i | x ) S Y ( t i | x ) 2 + O ( a n 2 ) sup y [ t i , t i + 1 ] 1 S Y ( t i + 1 | x ) 2 S ^ Y ( y | x ) S Y ( y | x ) S ^ Y ( t i | x ) + S Y ( t i | x ) + O ( a n 2 ) C 4 max j sup y [ t i j , t i ( j + 1 ) ] S ^ Y ( y | x ) S Y ( t i j | x ) S ^ Y ( t i | x ) + S Y ( t i | x ) + O ( a n 3 / 2 ) + O ( a n 2 ) C 4 max j S ^ Y ( t i j | x ) S Y ( t i j | x ) S ^ Y ( t i | x ) + S Y ( t i | x ) + O ( a n 3 / 2 ) ,
almost surely, where C 4 is some constant. Then we have,
| I I 2 | O ( 1 ) max 1 i k n H ^ ( t i j | x ) H ( t i j | x ) H ^ ( t i | x ) + H ( t i | x ) + max 1 i k n max 1 j b n ( S ^ Y ( t i j | x ) ) ( S Y ( t i j | x ) ) ( S ^ Y ( t i | x ) + ( S Y ( t i | x ) ) ) + O ( a n 3 / 2 )
As deduced in [24], we have
| I I 2 | = O ( a n 3 / 2 ) + h 2 .
Combining the results of I , I I 1 and I I 2 together completes the proof of Theorem 1. □
Proof of Corollary 1. 
By Taylor’s expansion of the function exp ( · ) around Λ T ( t | x ) , there exists a Λ ˜ ( t | x ) between Λ ^ ( t | x ) and Λ ( t | x ) such that
S ^ T ( t | x ) S T ( t | x ) = exp { Λ ^ T ( t | x ) } exp { Λ T ( t | x ) } = exp { Λ T ( t | x ) } exp { Λ T ( t | x ) } × ( Λ ^ T ( t | x ) + Λ T ( t | x ) ) exp ( Λ ˜ ( t | x ) ) ( Λ ˜ T ( t | x ) + Λ T ( t | x ) ) 2 + exp { Λ T ( t | x ) } = S T ( t | x ) × ( Λ ^ T ( t | x ) + Λ T ( t | x ) ) exp ( Λ ˜ ( t | x ) ) ( Λ ^ T ( t | x ) + Λ T ( t | x ) ) 2
Noting that
Λ ^ T ( t | x ) Λ T ( t | x ) = 0 t 1 S Y ( u | x ) d ( H ^ ( u | x ) H ( u | x ) ) + 0 t 1 S ^ Y ( u | x ) 1 S Y ( u | x ) d H ^ ( u | x ) + O ( n 1 ϕ x ( h ) 1 ) a . s .
by Proposition 1, we have,
sup 0 < t < τ sup x X | Λ ^ T ( t | x ) Λ T ( t | x ) | = O a n a . s .
Therefore,
S ^ T ( t | x ) S T ( t | x ) = S T ( t | x ) × ( Λ ^ T ( t | x ) + Λ T ( t | x ) ) + O a n a . s .
By Theorem 1, we obtain
S ^ T ( t | x ) S T ( t | x ) = j = 1 n B n j ( x ) ξ ( Y j , δ j , t , x ) + O h 2 + ψ ( log n / n ) n ϕ x ( h ) 3 / 4 a . s .
If n h 5 0 and n 1 h 2 ( ψ ( log n / n ) / ϕ x ( h ) ) 3 0 ,
( n h ) 1 / 2 O ψ ( log n / n ) n ϕ ( h ) 3 / 4 + h 2 = o ( 1 ) .
Therefore, ( n h ) 1 / 2 [ S ^ T ( t | x ) S T ( t | x ) ] and ( n h ) 1 / 2 j = 1 n B n j ( x ) ξ ( Y j , δ j , t , x ) have the same asymptotic distribution.
Since ξ ( Y j , δ j , t , x ) satisfies E [ ξ ( Y j , δ j , t , x ) ] = 0 and E [ ξ 2 ( Y j , δ j , t , x ) ] < , for j = 1 , . . n and it is easy to see that E h B n j ( x ) ξ ( Y j , δ j , t , x ) 2 < , we have
( n h ) 1 / 2 j = 1 n B n j ( x ) ξ ( Y j , δ j , t , x ) d N ( 0 , V ( x , t ) ) ,
by Central Limit Theorem, for some variance function N ( 0 , V ( x , t ) ) . □
Additional Simulations: Per the suggestion of one of the referees, we extended the simulation study to examine the performance of the proposed method when the sample size is very small. We consider the sample size 50 for Scenarios 1 and 3 with censoring rates 15 % and 25 % . The results are presented in Figure A1 and Table A1.
Figure A1. The boxplots of the MSPE and the average Brier score over 100 replications plotted against the grid of bandwidth for scenario 1 and scenario 3 with sample size 50.
Figure A1. The boxplots of the MSPE and the average Brier score over 100 replications plotted against the grid of bandwidth for scenario 1 and scenario 3 with sample size 50.
Stats 05 00066 g0a1
We first examine the performance of the proposed Brier score-based bandwidth selector. By comparing Figure 1 and Figure A1, it is clear that the differences between the bandwidths selected by the proposed method and the “optimal” one using the hypothetical MSE increase as the sample size decreases, which suggests a performance degradation of our proposed bandwidth selector, in both scenarios. Moreover, the accuracy of the proposed method in estimating the conditional survival probability also decreases, as sample sizes decrease (see Table 1 and Table A1). However, we note that in Scenario 1 where the survival probability depends on the functional covariate, the proposed estimator is still superior to the KM estimator. More importantly, the performance of the proposed method is still comparable to the KM estimator in Scenario 3, where the functional covariate does not affect the survival probability, indicating that the reliability of the proposed estimator for a small sample is on the same level as the traditional KM estimator.
Table A1. The MSPEs of the survival probability in the test data using conditional functional KM, regular KM, and FLCRM for scenario 1 with sample size 50.
Table A1. The MSPEs of the survival probability in the test data using conditional functional KM, regular KM, and FLCRM for scenario 1 with sample size 50.
15% Censoring25% Censoring
nMethodMeanSDMeanSD
Scenario 150Cond.KM.MSE 0.0721 0.0156 0.0772 0.0178
Cond.KM.Brier0.07590.01630.08060.0191
KM0.10650.01080.11030.0106
Scenario 350Cond.KM.MSE0.05330.01760.06070.0197
Cond.KM.Brier0.05660.01840.06360.0214
KM 0.0509 0.0165 0.0572 0.0176
Cond.KM.Brier = Conditional Kaplan–Meier (Bandwidth selection based on Brier scores), Cond.KM.MSE =Conditional Kaplan–Meier (Bandwidth selection based on MSE), KM = Kaplan–Meier and FLCRM = FunctionalLinear Cox Regression Model. □ indicates the best MSE.

References

  1. Borggaard, C.; Thodberg, H.H. Optimal minimal neural interpretation of spectra. Anal. Chem. 1992, 64, 545–551. [Google Scholar] [CrossRef]
  2. Ferraty, F.; Vieu, P. Curves discrimination: A nonparametric functional approach. Comput. Stat. Data Anal. 2003, 44, 161–173. [Google Scholar] [CrossRef]
  3. Febrero, M.; Galeano, P.; González-Manteiga, W. Outlier detection in functional data by depth measures, with application to identify abnormal NOx levels. Environmetrics Off. J. Int. Environmetrics Soc. 2008, 19, 331–345. [Google Scholar] [CrossRef]
  4. Ramsay, J.O.; Silverman, B.W. Applied Functional Data Analysis: Methods and Case Studies; Springer: Berlin/Heidelberg, Germany, 2002; Volume 77. [Google Scholar]
  5. Müller, H.G.; Stadtmüller, U. Generalized functional linear models. Ann. Stat. 2005, 33, 774–805. [Google Scholar] [CrossRef] [Green Version]
  6. James, G.M. Generalized linear models with functional predictors. J. R. Stat. Soc. Ser. B Stat. Methodol. 2002, 64, 411–432. [Google Scholar] [CrossRef]
  7. Marx, B.D.; Eilers, P.H. Generalized linear regression on sampled signals and curves: A P-spline approach. Technometrics 1999, 41, 1–13. [Google Scholar] [CrossRef]
  8. Cardot, H.; Ferraty, F.; Sarda, P. Functional linear model. Stat. Probab. Lett. 1999, 45, 11–22. [Google Scholar] [CrossRef]
  9. Cardot, H.; Ferraty, F.; Sarda, P. Spline estimators for the functional linear model. Stat. Sin. 2003, 13, 571–591. [Google Scholar]
  10. Cardot, H.; Sarda, P. Estimation in generalized linear models for functional data via penalized likelihood. J. Multivar. Anal. 2005, 92, 24–41. [Google Scholar] [CrossRef] [Green Version]
  11. Ferraty, F.; Vieu, P. Nonparametric Functional Data Analysis: Theory and Practice; Springer Science & Business Media: Berlin/Heidelberg, Germany, 2006. [Google Scholar]
  12. Ferraty, F.; Mas, A.; Vieu, P. Nonparametric regression on functional data: Inference and practical aspects. Aust. N. Z. J. Stat. 2007, 49, 267–286. [Google Scholar] [CrossRef] [Green Version]
  13. Locantore, N.; Marron, J.; Simpson, D.; Tripoli, N.; Zhang, J.; Cohen, K.; Boente, G.; Fraiman, R.; Brumback, B.; Croux, C.; et al. Robust principal component analysis for functional data. Test 1999, 8, 1–73. [Google Scholar] [CrossRef]
  14. Kong, D.; Ibrahim, J.G.; Lee, E.; Zhu, H. FLCRM: Functional linear cox regression model. Biometrics 2018, 74, 109–117. [Google Scholar] [CrossRef] [PubMed] [Green Version]
  15. Hasenstab, K.; Scheffler, A.; Telesca, D.; Sugar, C.A.; Jeste, S.; DiStefano, C.; Şentürk, D. A multi-dimensional functional principal components analysis of EEG data. Biometrics 2017, 73, 999–1009. [Google Scholar] [CrossRef] [PubMed] [Green Version]
  16. Zhou, Y.; Sedransk, N. Functional data analytic approach of modeling ECG T-wave shape to measure cardiovascular behavior. Ann. Appl. Stat. 2009, 3, 1382–1402. [Google Scholar] [CrossRef] [Green Version]
  17. Fang, H.B.; Wu, T.T.; Rapoport, A.P.; Tan, M. Survival analysis with functional covariates for partial follow-up studies. Stat. Methods Med. Res. 2016, 25, 2405–2419. [Google Scholar] [CrossRef]
  18. Gellar, J.E.; Colantuoni, E.; Needham, D.M.; Crainiceanu, C.M. Cox regression models with functional covariates for survival data. Stat. Model. 2015, 15, 256–278. [Google Scholar] [CrossRef] [Green Version]
  19. Schmee, J.; Hahn, G.J. A simple method for regression analysis with censored data. Technometrics 1979, 21, 417–432. [Google Scholar] [CrossRef]
  20. Müller, H.G.; Zhang, Y. Time-varying functional regression for predicting remaining lifetime distributions from longitudinal trajectories. Biometrics 2005, 61, 1064–1075. [Google Scholar] [CrossRef] [Green Version]
  21. Kaplan, E.L.; Meier, P. Nonparametric estimation from incomplete observations. J. Am. Stat. Assoc. 1958, 53, 457–481. [Google Scholar] [CrossRef]
  22. Beran, R. Nonparametric Regression with Randomly Censored Survival Data; Technical Report; University of California: Berkeley, CA, USA, 1981. [Google Scholar]
  23. Gentleman, R.; Crowley, J. Graphical methods for censored data. J. Am. Stat. Assoc. 1991, 86, 678–683. [Google Scholar] [CrossRef]
  24. Gonzalez-Manteiga, W.; Cadarso-Suarez, C. Asymptotic properties of a generalized Kaplan–Meier estimator with some applications. Commun. Stat.-Theory Methods 1994, 4, 65–78. [Google Scholar] [CrossRef]
  25. Rutikanga, J.U.; Diop, A. Functional Kernel Estimation of the Conditional Extreme Quantile under Random Right Censoring. Open J. Stat. 2021, 11, 162. [Google Scholar] [CrossRef]
  26. Graf, E.; Schmoor, C.; Sauerbrei, W.; Schumacher, M. Assessment and comparison of prognostic classification schemes for survival data. Stat. Med. 1999, 18, 2529–2545. [Google Scholar] [CrossRef]
  27. Gerds, T.A.; Schumacher, M. Consistent estimation of the expected Brier score in general survival models with right-censored event times. Biom. J. 2006, 48, 1029–1040. [Google Scholar] [CrossRef]
  28. Parzen, E. On estimation of a probability density function and mode. Ann. Math. Stat. 1962, 33, 1065–1076. [Google Scholar] [CrossRef]
  29. Nadaraya, E.A. On estimating regression. Theory Probab. Its Appl. 1964, 9, 141–142. [Google Scholar] [CrossRef]
  30. Watson, G.S. Smooth regression analysis. Sankhyā Indian J. Stat. Ser. A 1964, 26, 359–372. [Google Scholar]
  31. Gasser, T.; Müller, H.G. Kernel estimation of regression functions. In Smoothing Techniques for Curve Estimation; Springer: Berlin/Heidelberg, Germany, 1979; pp. 23–68. [Google Scholar]
  32. Ma, S. Estimation and inference in functional single-index models. Ann. Inst. Stat. Math. 2016, 68, 181–208. [Google Scholar] [CrossRef]
  33. De Boor, C. A Practical Guide to Splines; Applied Mathematical Sciences Volume 27; Springer: New York, NY, USA, 2001. [Google Scholar]
  34. Dabrowska, D.M. Non-parametric regression with censored survival time data. Scand. J. Stat. 1987, 14, 181–197. [Google Scholar]
  35. Dabrowska, D.M. Uniform consistency of the kernel conditional Kaplan–Meier estimate. Ann. Stat. 1989, 17, 1157–1167. [Google Scholar] [CrossRef]
  36. Kara-Zaitri, L.; Laksaci, A.; Rachdi, M.; Vieu, P. Uniform in bandwidth consistency for various kernel estimators involving functional data. J. Nonparametr. Stat. 2017, 29, 85–107. [Google Scholar] [CrossRef]
  37. Berg, A.; Suaray, K. Bootstrap bandwidth selection for a smooth survival function estimator from censored data. J. Stat. Res. 2010, 44, 207. [Google Scholar]
  38. Harrell, F.E. Regression Modeling Strategies: With Applications to Linear Models, Logistic and Ordinal Regression, and Survival Analysis; Springer: Berlin/Heidelberg, Germany, 2015; Volume 3. [Google Scholar]
  39. Kattan, M.W.; Gerds, T.A. The index of prediction accuracy: An intuitive measure useful for evaluating risk prediction models. Diagn. Progn. Res. 2018, 2, 7. [Google Scholar] [CrossRef] [PubMed]
  40. Zhang, Z.; Cortese, G.; Combescure, C.; Marshall, R.; Lee, M.; Lim, H.J.; Haller, B. Overview of model validation for survival regression model with competing risks using melanoma study data. Ann. Transl. Med. 2018, 6, 325. [Google Scholar] [CrossRef] [PubMed]
  41. Kvamme, H.; Borgan, Ø. The brier score under administrative censoring: Problems and solutions. arXiv 2019, arXiv:1912.08581. [Google Scholar]
  42. Ferraty, F.; Laksaci, A.; Tadj, A.; Vieu, P. Rate of uniform consistency for nonparametric estimates with functional variables. J. Stat. Plan. Inference 2010, 140, 335–352. [Google Scholar] [CrossRef]
  43. Bouzebda, S.; Nemouchi, B. Uniform consistency and uniform in bandwidth consistency for nonparametric regression estimates and conditional U-statistics involving functional data. J. Nonparametr. Stat. 2020, 32, 452–509. [Google Scholar] [CrossRef]
  44. Kuelbs, J.; Li, W.V. Metric entropy and the small ball problem for Gaussian measures. J. Funct. Anal. 1993, 116, 133–157. [Google Scholar] [CrossRef] [Green Version]
  45. Nicoleris, T.; Yatracos, Y.G. Rates of convergence of estimates, Kolmogorov’s entropy and the dimensionality reduction principle in regression. Ann. Stat. 1997, 25, 2493–2511. [Google Scholar] [CrossRef]
  46. Silverman, B.W. Density Estimation for Statistics and Data Analysis; Routledge: London, UK, 2018. [Google Scholar]
  47. Jack, C.R.; Petersen, R.C.; Xu, Y.C.; O’Brien, P.C.; Smith, G.E.; Ivnik, R.J.; Boeve, B.F.; Waring, S.C.; Tangalos, E.G.; Kokmen, E. Prediction of AD with MRI-based hippocampal volume in mild cognitive impairment. Neurology 1999, 52, 1397. [Google Scholar] [CrossRef] [Green Version]
  48. Fjell, A.M.; Walhovd, K.B.; Fennema-Notestine, C.; McEvoy, L.K.; Hagler, D.J.; Holland, D.; Brewer, J.B.; Dale, A.M.; Initiative, A.D.N. CSF biomarkers in prediction of cerebral and clinical change in mild cognitive impairment and Alzheimer’s disease. J. Neurosci. 2010, 30, 2088–2101. [Google Scholar] [CrossRef] [Green Version]
  49. Barnes, D.E.; Cenzer, I.S.; Yaffe, K.; Ritchie, C.S.; Lee, S.J.; Alzheimer’s Disease Neuroimaging Initiative. A point-based tool to predict conversion from mild cognitive impairment to probable Alzheimer’s disease. Alzheimer’s Dement. 2014, 10, 646–655. [Google Scholar] [CrossRef] [PubMed] [Green Version]
  50. Li, K.; Chan, W.; Doody, R.S.; Quinn, J.; Luo, S.; Alzheimer’s Disease Neuroimaging Initiative. Prediction of conversion to Alzheimer’s disease with longitudinal measures and time-to-event data. J. Alzheimer’s Dis. 2017, 58, 361–371. [Google Scholar] [CrossRef] [PubMed] [Green Version]
  51. Thompson, P.M.; Hayashi, K.M.; De Zubicaray, G.I.; Janke, A.L.; Rose, S.E.; Semple, J.; Hong, M.S.; Herman, D.H.; Gravano, D.; Doddrell, D.M.; et al. Mapping hippocampal and ventricular change in Alzheimer disease. Neuroimage 2004, 22, 1754–1766. [Google Scholar] [CrossRef] [PubMed]
  52. Apostolova, L.G.; Dinov, I.D.; Dutton, R.A.; Hayashi, K.M.; Toga, A.W.; Cummings, J.L.; Thompson, P.M. 3D comparison of hippocampal atrophy in amnestic mild cognitive impairment and Alzheimer’s disease. Brain 2006, 129, 2867–2873. [Google Scholar] [CrossRef]
  53. Blanken, A.E.; Hurtz, S.; Zarow, C.; Biado, K.; Honarpisheh, H.; Somme, J.; Brook, J.; Tung, S.; Kraft, E.; Lo, D.; et al. Associations between hippocampal morphometry and neuropathologic markers of Alzheimer’s disease using 7 T MRI. NeuroImage Clin. 2017, 15, 56–61. [Google Scholar] [CrossRef] [Green Version]
  54. Wang, H.J.; Wang, L. Locally weighted censored quantile regression. J. Am. Stat. Assoc. 2009, 104, 1117–1128. [Google Scholar] [CrossRef] [Green Version]
  55. Leng, C.; Tong, X. A quantile regression estimator for censored data. Bernoulli 2013, 19, 344–361. [Google Scholar] [CrossRef] [Green Version]
  56. Peng, L.; Huang, Y. Survival analysis with quantile regression models. J. Am. Stat. Assoc. 2008, 103, 637–649. [Google Scholar] [CrossRef]
  57. Zheng, Q.; Peng, L.; He, X. High dimensional censored quantile regression. Ann. Stat. 2018, 46, 308. [Google Scholar] [CrossRef]
Figure 1. The average Brier score over 100 replications plotted against the grid of bandwidth for different scenarios. The vertical lines indicate the optimal bandwidth based on Brier scores and MSE.
Figure 1. The average Brier score over 100 replications plotted against the grid of bandwidth for different scenarios. The vertical lines indicate the optimal bandwidth based on Brier scores and MSE.
Stats 05 00066 g001
Figure 2. The boxplots represent the sampling distribution of the MSPE based on the 100 simulation testing sets. Cond.KM.Brier = Conditional Kaplan–Meier (Bandwidth selection based on Brier scores), Cond.KM.MSE = Conditional Kaplan–Meier (Bandwidth selection based on MSE), KM = Kaplan–Meier and FLCRM = Functional Linear Cox Regression Model.
Figure 2. The boxplots represent the sampling distribution of the MSPE based on the 100 simulation testing sets. Cond.KM.Brier = Conditional Kaplan–Meier (Bandwidth selection based on Brier scores), Cond.KM.MSE = Conditional Kaplan–Meier (Bandwidth selection based on MSE), KM = Kaplan–Meier and FLCRM = Functional Linear Cox Regression Model.
Stats 05 00066 g002
Figure 3. Brier scores on the ADNI data for different methods: Cond.KM.Brier = Conditional Kaplan–Meier (Bandwidth selection based on Brier scores), KM = Kaplan–Meier and FLCRM = Functional Linear Cox Regression Model.
Figure 3. Brier scores on the ADNI data for different methods: Cond.KM.Brier = Conditional Kaplan–Meier (Bandwidth selection based on Brier scores), KM = Kaplan–Meier and FLCRM = Functional Linear Cox Regression Model.
Stats 05 00066 g003
Table 1. The MSPEs of the survival probability in the test data using conditional functional KM, regular KM, and FLCRM under different scenarios.
Table 1. The MSPEs of the survival probability in the test data using conditional functional KM, regular KM, and FLCRM under different scenarios.
15% Censoring25% Censoring
nMethodMeanSDMeanSD
Scenario 1100Cond.KM.MSE 0.0588 0.0118 0.0618 0.0106
Cond.KM.Brier0.06170.01230.06440.0113
KM0.10340.00640.10350.0063
400Cond.KM.MSE 0.0381 0.0047 0.0421 0.0060
Cond.KM.Brier0.03930.00510.04370.0067
KM0.09900.00520.09920.0053
Scenario 2100Cond.KM.MSE 0.0796 0.0092 0.0825 0.0081
Cond.KM.Brier0.08430.01060.08820.0098
KM0.18650.01210.18840.0117
400Cond.KM.MSE 0.0552 0.0061 0.0569 0.0051
Cond.KM.Brier0.05690.00660.06090.0071
KM0.18770.01120.18380.0110
Scenario 3100Cond.KM.MSE0.03780.01300.04170.0149
Cond.KM.Brier0.03920.01290.04370.0149
KM 0.0362 0.0122 0.0398 0.0133
400Cond.KM.MSE0.02100.00660.02370.0082
Cond.KM.Brier0.02270.00720.02510.0083
KM 0.0204 0.0064 0.0228 0.0079
Scenario 4100Cond.KM.MSE 0.0824 0.0103 0.0935 0.0152
Cond.KM.Brier0.08580.01140.09840.0152
KM0.16610.01350.16960.0148
FLCRM0.18050.10670.18170.0994
400Cond.KM.MSE 0.0594 0.0073 0.0674 0.0084
Cond.KM.Brier0.06200.00820.07460.0108
KM0.16210.01050.16610.0125
FLCRM0.17570.11430.17760.1120
Cond.KM.Brier = Conditional Kaplan–Meier (Bandwidth selection based on Brier scores), Cond.KM.MSE =Conditional Kaplan–Meier (Bandwidth selection based on MSE), KM = Kaplan–Meier and FLCRM = FunctionalLinear Cox Regression Model. □ indicates the best MSE.
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Share and Cite

MDPI and ACS Style

Tholkage, S.; Zheng, Q.; Kulasekera, K.B. Conditional Kaplan–Meier Estimator with Functional Covariates for Time-to-Event Data. Stats 2022, 5, 1113-1129. https://doi.org/10.3390/stats5040066

AMA Style

Tholkage S, Zheng Q, Kulasekera KB. Conditional Kaplan–Meier Estimator with Functional Covariates for Time-to-Event Data. Stats. 2022; 5(4):1113-1129. https://doi.org/10.3390/stats5040066

Chicago/Turabian Style

Tholkage, Sudaraka, Qi Zheng, and Karunarathna B. Kulasekera. 2022. "Conditional Kaplan–Meier Estimator with Functional Covariates for Time-to-Event Data" Stats 5, no. 4: 1113-1129. https://doi.org/10.3390/stats5040066

APA Style

Tholkage, S., Zheng, Q., & Kulasekera, K. B. (2022). Conditional Kaplan–Meier Estimator with Functional Covariates for Time-to-Event Data. Stats, 5(4), 1113-1129. https://doi.org/10.3390/stats5040066

Article Metrics

Back to TopTop