Local Linear Estimation for Time-Dependent Coefficients in Cox's Regression Models

This article develops a local partial likelihood technique to estimate the time-dependent coefficients in Cox's regression model. The basic idea is a simple extension of the local linear fitting technique used in the scatterplot smoothing. The coefficients are estimated locally based on the partial likelihood in a window around each time point. Multiple time-dependent covariates are incorporated in the local partial likelihood procedure. The procedure is useful as a diagnostic tool and can be used in uncovering time-dependencies or departure from the proportional hazards model. The programming involved in the local partial likelihood estimation is relatively simple and it can be modified with few efforts from the existing programs for the proportional hazards model. The asymptotic properties of the resulting estimator are established and compared with those from the local constant fitting. A consistent estimator of the asymptotic variance is also proposed. The approach is illustrated by a real data set from the study of gastric cancer patients and a simulation study is also presented.     

A Smooth Test in Proportional Hazard Survival Models Using Local Partial Likelihood Fitting

Proportional hazard models for survival data, even though popular and numerically handy, suffer from the restrictive assumption that covariate effects are constant over survival time. A number of tests have been proposed to check this assumption. This paper contributes to this area by employing local estimates allowing to fit hazard models in which covariate effects are smoothly varying with time. A formal test is derived to check for proportional hazards against smooth hazards as alternative. The test proves to possess omnibus power in that it is powerful against arbitrary but smooth alternatives. Comparative simulations and two data examples accompany the presentation. Extensions are provided to multiple covariate settings, where the focus of interest is to decide which of the covariate effects vary with time.     

变权重组合预测模型的局部加权最小二乘解法

随着科学技术的不断进步，预测方法也得到了很大的发展，常见的预测方法就有数十种之多。而组合预测是将不同的预测方法组合起来，综合利用各个方法所提供的信息，其效果往往优于单一的预测方法，故得到了广泛的应用。而基于变系数模型的思想研究了组合预测模型，将变权重的求取转化为变系数模型中系数函数的估计问题，从而可以基于局部加权最小二乘方法求解，利用交叉证实法选取光滑参数。其结果表明所提方法预测精度很高，效果优于其他方法。     

Outlier Detection in Time Series Models Using Local Influence Method

We propose a new procedure for detecting a patch of outliers or influential observations for autoregressive integrated moving average (ARIMA) model using local influence analysis. It is shown that the dependency aspects of time series data gives rise to masking or smearing effects when the local influence analysis is performed using current perturbation schemes. We suggest a new perturbation scheme to take into account the dependent structure of time series data, and employ the stepwise local influence method to give a diagnostic procedure. We show that the new perturbation scheme can avoid the smearing effects, and the stepwise technique of local influence can successfully deal with masking effects. Various simulation studies are performed to show the efficiency of proposed methodology and a real example is used for illustrations.     

Local Influence Analysis for Penalized Gaussian Likelihood Estimators in Partially Linear Models

Abstract. Partially linear models are extensions of linear models to include a non-parametric function of some covariate. They have been found to be useful in both cross-sectional and longitudinal studies. This paper provides a convenient means to extend Cook's local influence analysis to the penalized Gaussian likelihood estimator that uses a smoothing spline as a solution to its non-parametric component. Insight is also provided into the interplay of the influence or leverage measures between the linear and the non-parametric components in the model. The diagnostics are applied to a mouthwash data set and a longitudinal hormone study with informative results.     

Using Multinomial Mixture Models to Cluster Internet Traffic

The paper considers the clustering of two large sets of Internet traffic data consisting of information measured from headers of transmission control protocol packets collected on a busy arc of a university network connecting with the Internet. Packets are grouped into 'flows' thought to correspond to particular movements of information between one computer and another. The clustering is based on representing the flows as each sampled from one of a finite number of multinomial distributions and seeks to identify clusters of flows containing similar packet‐length distributions. The clustering uses the EM algorithm, and the data‐analytic and computational details are given.     

Fitting three-dimensional Laguerre tessellations to foam structures

Foam models, especially random tessellations, are powerful tools to study the relations between the geometric structure of foams and their physical properties. In this paper, we propose the use of random Laguerre tessellations, weighted versions of the well-known Voronoi tessellations, as models for the microstructure of foams. Based on geometric characteristics estimated from a tomographic image of a closed-cell polymer foam, we fit a Laguerre tessellation model to the material. It is shown that this model allows for a better fit of the geometric structure of the foam than some classical Voronoi tessellation models.     

Convergence in the Wasserstein Metric for Markov Chain Monte Carlo Algorithms with Applications to Image Restoration

Abstract

In this paper, we show how the time for convergence to stationarity of a Markov chain can be assessed using the Wasserstein metric, rather than the usual choice of total variation distance. The Wasserstein metric may be more easily applied in some applications, particularly those on continuous state spaces. Bounds on convergence time are established by considering the number of iterations required to approximately couple two realizations of the Markov chain to within ε tolerance. The particular application considered is the use of the Gibbs sampler in the Bayesian restoration of a degraded image, with pixels that are a continuous grey-scale and with pixels that can only take two colours. On finite state spaces, a bound in the Wasserstein metric can be used to find a bound in total variation distance. We use this relationship to get a precise O(N log N) bound on the convergence time of the stochastic Ising model that holds for appropriate values of its parameter as well as other binary image models. Our method employing convergence in the Wasserstein metric can also be applied to perfect sampling algorithms involving coupling from the past to obtain estimates of their running times.