Parameter selection in modified histogram estimates

A multivariate modified histogram density estimate depending on a reference density g and a partition P has been proved to have good consistency properties according to several information theoretic criteria. Given an i.i.d. sample, we show how to select automatically both g and P so that the expected L ₁ error of the corresponding selected estimate is within a given constant multiple of the best possible error plus an additive term which tends to zero under mild assumptions. Our method is inspired by the combinatorial tools developed by Devroye and Lugosi [Devroye, L. and Lugosi, G., 2001, Combinatorial Methods in Density Estimation (New York, NY: Springer–Verlag)] and it includes a wide range of reference density and partition models. Results of simulations are also presented.     

Non-linear models 1

This is the first application of a new method for testing stationary random point processes. Consider the class of all stationary ergodic point processes on the real line with arbitrary dependences among the inter–point distances (spacing).The hypothesis is :The observed process φ is a homogeneous Poisson process or more (resp.less) regular than a Poisson process.The sample is the vector of the first n points t₁, …,t_n.There is a close relation between our method for testing and queueing theory: For finding an appropriate test statistic, we observe the behaviour of a single server queue with the input φ.A table of critical values is given.     

On the cohen-sackrowitz estimator of a common mean

The paper reconsider certain estimators proposed by COHENand SACKROWITZ[Ann.Statist.(1974)2,1274-1282,Ann.Statist.4,1294]for the common mean of two normal distributions on the basis of independent samples of equal size from the two populations. It derives the ncecessary and sufficient condition for improvement over the first sample mean, under squared error loss, for any member of a class containing these. It shows that the estimator proposded by them for simultaneous improvement over botyh sample means has the desired property if and only if the common size of the samples is at least nine. The requirement is milder than that for any other estimator at the present state of knolwledge and may be constrasted with their result which implies the desired property of the estimator only if the common size of the samples is at least fifteen. Upper bounds for variances if the estimators derived by them are also improved     

A clustering approach to interpretable principal components

A new method for constructing interpretable principal components is proposed. The method first clusters the variables, and then interpretable (sparse) components are constructed from the correlation matrices of the clustered variables. For the first step of the method, a new weighted-variances method for clustering variables is proposed. It reflects the nature of the problem that the interpretable components should maximize the explained variance and thus provide sparse dimension reduction. An important feature of the new clustering procedure is that the optimal number of clusters (and components) can be determined in a non-subjective manner. The new method is illustrated using well-known simulated and real data sets. It clearly outperforms many existing methods for sparse principal component analysis in terms of both explained variance and sparseness.     

Flexible Copula Density Estimation with Penalized Hierarchical B‐splines

The paper introduces a new method for flexible spline fitting for copula density estimation. Spline coefficients are penalized to achieve a smooth fit. To weaken the curse of dimensionality, instead of a full tensor spline basis, a reduced tensor product based on so called sparse grids (Notes Numer. Fluid Mech. Multidiscip. Des., 31, 1991, 241‐251) is used. To achieve uniform margins of the copula density, linear constraints are placed on the spline coefficients, and quadratic programming is used to fit the model. Simulations and practical examples accompany the presentation.     

k-POD: A Method for k-Means Clustering of Missing Data

The k-means algorithm is often used in clustering applications but its usage requires a complete data matrix. Missing data, however, are common in many applications. Mainstream approaches to clustering missing data reduce the missing data problem to a complete data formulation through either deletion or imputation but these solutions may incur significant costs. Our k-POD method presents a simple extension of k-means clustering for missing data that works even when the missingness mechanism is unknown, when external information is unavailable, and when there is significant missingness in the data.

[Received November 2014. Revised August 2015.]     

A new goodness of fit test for the equality of multinomial cell probabilities versus trend alternatives

In this paper, a new test statistic is presented for testing the null hypothesis of equal multinomial cell probabilities versus various trend alternatives. Exact asymptotic critical values are obtained, The power of the test is compared with several other statistics considered by Choulakian et al (1995), The test is shown to have better power for certain trend alternatives.