Generalized Leverage and its Applications

The generalized leverage of an estimator is defined in regression models as a measure of the importance of individual observations. We derive a simple but powerful result, developing an explicit expression for leverage in a general M -estimation problem, of which the maximum likelihood problems are special cases. A variety of applications are considered, most notably to the exponential family non-linear models. The relationship between leverage and local influence is also discussed. Numerical examples are given to illustrate our results     

一种非刚体目标的实时检测与跟踪算法

提出了一种复杂背景下自动、实时地检测和跟踪非刚体目标算法。该算法利用自适应的背景减除方法,在复杂背景条件下提取出运动目标;采用颜色直方图模型为特征的均值平移法作为跟踪算法。试验结果验证了该算法的实时性和有效性。     

On the strengths of the self-updating process clustering algorithm

The self-updating process (SUP) is a clustering algorithm that stands from the viewpoint of data points and simulates the process how data points move and perform self-clustering. It is an iterative process on the sample space and allows for both time-varying and time-invariant operators. By simulations and comparisons, this paper shows that SUP is particularly competitive in clustering (i) data with noise, (ii) data with a large number of clusters, and (iii) unbalanced data. When noise is present in the data, SUP is able to isolate the noise data points while performing clustering simultaneously. The property of the local updating enables SUP to handle data with a large number of clusters and data of various structures. In this paper, we showed that the blurring mean-shift is a static SUP. Therefore, our discussions on the strengths of SUP also apply to the blurring mean-shift.     

Some matrix results related to a partitioned singular linear model

Consider the linear model (y, Xβ V), where the model matrix X may not have a full column rank and V might be singular. In this paper we introduce a formula for the difference between the BLUES of Xβ under the full model and the model where one observation has been deleted. We also consider the partitioned linear regression model where the model matrix is (X₁: X₂) the corresponding vector of unknown parameters being (β′₁ : β′₂)′. We show that the BLUE of X₁ β₁ under a specific reduced model equals the corresponding BLUE under the original full model and consider some interesting consequences of this result.     

Simultaneous variable selection and outlier identification in linear regression using the mean-shift outlier model

We provide a method for simultaneous variable selection and outlier identification using the mean-shift outlier model. The procedure consists of two steps: the first step is to identify potential outliers, and the second step is to perform all possible subset regressions for the mean-shift outlier model containing the potential outliers identified in step 1. This procedure is helpful for model selection while simultaneously considering outlier identification, and can be used to identify multiple outliers. In addition, we can evaluate the impact on the regression model of simultaneous omission of variables and interesting observations. In an example, we provide detailed output from the R system, and compare the results with those using posterior model probabilities as proposed by Hoeting et al. [Comput. Stat. Data Anal. 22 (1996), pp. 252-270] for simultaneous variable selection and outlier identification.     

Mean-shift outliers model in skew scale-mixtures of normal distributions

ABSTRACT

Asymmetric models have been discussed quite extensively in recent years, in situations where the normality assumption is suspected due to lack of symmetry in the data. Techniques for assessing the quality of fit and diagnostic analysis are important for model validation. This paper presents a study of the mean-shift method for the detection of outliers in regression models under skew scale-mixtures of normal distributions. Analytical solutions for the estimators of the parameters are obtained through the use of Expectation–Maximization algorithm. The observed information matrix for the calculation of standard errors is obtained for each distribution. Simulation studies and an application to the analysis of a data have been carried out, showing the efficiency of the proposed method in detecting outliers.     

Interval-censored unimodal kernel density estimation via data sharpening

In this paper, we extend Choi and Hall's [Data sharpening as a prelude to density estimation. Biometrika. 1999;86(4):941–947] data sharpening algorithm for kernel density estimation to interval-censored data. Data sharpening has several advantages, including bias and mean integrated squared error (MISE) reduction as well as increased robustness to bandwidth misspecification. Several interval metrics are explored for use with the kernel function in the data sharpening transformation. A simulation study based on randomly generated data is conducted to assess and compare the performance of each interval metric. It is found that the bias is reduced by sharpening, often with little effect on the variance, thus maintaining or reducing overall MISE. Applications involving time to onset of HIV and running distances subject to measurement error are used for illustration.     

Effect of correlation on the estimation of a mean in the presence of spurious observations

This paper examines the effect of correlation of observations on estimators of a mean which are designed to guard against the possibility of spurious observations (that is, observations generated in a manner not intended). The mean squared error, premium and protection of these estimators are evaluated and discussed for some specific correlation structures.