Classification with discrete and continuous variables via general mixed-data models

We study the problem of classifying an individual into one of several populations based on mixed nominal, continuous, and ordinal data. Specifically, we obtain a classification procedure as an extension to the so-called location linear discriminant function, by specifying a general mixed-data model for the joint distribution of the mixed discrete and continuous variables. We outline methods for estimating misclassification error rates. Results of simulations of the performance of proposed classification rules in various settings vis-à-vis a robust mixed-data discrimination method are reported as well. We give an example utilizing data on croup in children.     

Standard Distance in Univariate and Multivariate Analysis

We propose to use the term standard distance for the quantity in univariate analysis and show that it can be easily generalized to the multivariate situation, where it coincides with the square root of the Mahalanobis distance between two samples.     

Convergence criteria for interval-valued inequality indices

In this paper we introduce an interval-valued inequality index for random intervals based on a convex function. We show that if this function does not grow faster than x ^p , then the inequality index is continuous on the space of random intervals with finite p-th moment. A bound for the distance between the inequality indices of two random intervals is also constructed. An example is presented to motivate and illustrate the developments in this paper.     

Optimal collapsing of mixture distributions in robust recursive estimation

Several authors have discussed Kalman filtering procedures using a mixture of normals as a model for the distributions of the noise in the observation and/or the state space equations. Under this model, resulting posteriors involve a mixture of normal distributions, and a “collapsing method” must be found in order to keep the recursive procedure simple. We prove that the Kullback-Leibler distance between the mixture posterior and that of a single normal distribution is minimized when we choose the mean and variance of the single normal distribution to be the mean and variance of the mixture posterior. Hence, “collapsing by moments” is optimal in this sense. We then develop the resulting optimal algorithm for “Kalman filtering” for this situation, and illustrate its performance with an example.     

Parameter Estimation for Discrete Distributions by Generalized Hellinger-Type Divergence Based on Probability Generating Function

This article considers a probability generating function-based divergence statistic for parameter estimation. The performance and robustness of the proposed statistic in parameter estimation is studied for the negative binomial distribution by Monte Carlo simulation, especially in comparison with the maximum likelihood and minimum Hellinger distance estimation. Numerical examples are given as illustration of goodness of fit.     

INFLUENTIAL OBSERVATION IDENTIFICATION IN THE GROWTH CURVE MODEL WITH RAO'S SIMPLE COVARIANCE STRUCTURE

ABSTRACT

In this paper we discuss the identification of influential observations in a growth curve model with Rao's simple covariance structure. Based on the generalized Cook-type distance and the volume of a confidence ellipsoid, a variety of influence measures are proposed in terms of the case-deletion technique. Also, the influence of observations on a linear combination of regression coefficients is considered. For illustration, a practical example is analyzed using the proposed approach.     

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.     

The performance of diagnostic-robust generalized potentials for the identification of multiple high leverage points in linear regression

Leverage values are being used in regression diagnostics as measures of influential observations in the $X$-space. Detection of high leverage values is crucial because of their responsibility for misleading conclusion about the fitting of a regression model, causing multicollinearity problems, masking and/or swamping of outliers, etc. Much work has been done on the identification of single high leverage points and it is generally believed that the problem of detection of a single high leverage point has been largely resolved. But there is no general agreement among the statisticians about the detection of multiple high leverage points. When a group of high leverage points is present in a data set, mainly because of the masking and/or swamping effects the commonly used diagnostic methods fail to identify them correctly. On the other hand, the robust alternative methods can identify the high leverage points correctly but they have a tendency to identify too many low leverage points to be points of high leverages which is not also desired. An attempt has been made to make a compromise between these two approaches. We propose an adaptive method where the suspected high leverage points are identified by robust methods and then the low leverage points (if any) are put back into the estimation data set after diagnostic checking. The usefulness of our newly proposed method for the detection of multiple high leverage points is studied by some well-known data sets and Monte Carlo simulations.     

MINIMUM QUADRATIC DISTANCE ESTIMATION FOR A PARAMETRIC FAMILY OF DISCRETE DISTRIBUTIONS DEFINED RECURSIVELY

The distribution function of a random sum can easily be computed iteratively when the distribution of the number of independent identically distributed elements in the sum is itself defined recursively. Classical estimation procedures for such recursive parametric families often require specific distributional assumptions (e.g. Poisson, Negative Binomial). The minimum distance estimator proposed here is an estimator within a larger parametric family. The estimator is consistent, efficient when the parametric family is truncated, and can be made either robust or asymptotically efficient when the parametric family has infinite range. Its asymptotic distribution is derived. A brief illustration with Automobile Insurance data is included.     

光学分辨率判据和可见度

本文研究了两个非相干点光源靠近时，在圆孔的夫琅和费衍射下两个光斑之间可见度的变化情况。对于不同判据，可见度有明显差异，表现出各种判据的不一致性。同时还研究了光栅的夫琅和费衍射，当两明条纹很靠近时，可见度的变化情况。同样可以得到各判据相应的数值。