Inequality indices: theoretical and empirical aspects of their asymptotic behaviour

The authors use a Berry-Esseen type bound to identify the factors which influence the speed of convergence to the normal distribution of the indices of Gini, Piesch and Mehran. To empirically confirm the conclusions reached, a Monte Carlo experiment is performed for a log-logistic distribution.     

Goodness-of-Fit Testing for the Newcomb-Benford Law With Application to the Detection of Customs Fraud

The Newcomb-Benford law for digit sequences has recently attracted interest in antifraud analysis. However, most of its applications rely either on diagnostic checks of the data, or on informal decision rules. We suggest a new way of testing the Newcomb-Benford law that turns out to be particularly attractive for the detection of frauds in customs data collected from international trade. Our approach has two major advantages. The first one is that we control the rate of false rejections at each stage of the procedure, as required in antifraud applications. The second improvement is that our testing procedure leads to exact significance levels and does not rely on large-sample approximations. Another contribution of our work is the derivation of a simple expression for the digit distribution when the Newcomb-Benford law is violated, and a bound for a chi-squared type of distance between the actual digit distribution and the Newcomb-Benford one.     

The power of monitoring: how to make the most of a contaminated multivariate sample

Diagnostic tools must rely on robust high-breakdown methodologies to avoid distortion in the presence of contamination by outliers. However, a disadvantage of having a single, even if robust, summary of the data is that important choices concerning parameters of the robust method, such as breakdown point, have to be made prior to the analysis. The effect of such choices may be difficult to evaluate. We argue that an effective solution is to look at several pictures, and possibly to a whole movie, of the available data. This can be achieved by monitoring, over a range of parameter values, the results computed through the robust methodology of choice. We show the information gain that monitoring provides in the study of complex data structures through the analysis of multivariate datasets using different high-breakdown techniques. Our findings support the claim that the principle of monitoring is very flexible and that it can lead to robust estimators that are as efficient as possible. We also address through simulation some of the tricky inferential issues that arise from monitoring.     

Reinforced urns and the subdistribution beta‐Stacy process prior for competing risks analysis

In this paper, we introduce the subdistribution beta‐Stacy process, a novel Bayesian nonparametric process prior for subdistribution functions useful for the analysis of competing risks data. In particular, we (i) characterize this process from a predictive perspective by means of an urn model with reinforcement, (ii) show that it is conjugate with respect to right‐censored data, and (iii) highlight its relations with other prior processes for competing risks data. Additionally, we consider the subdistribution beta‐Stacy process prior in a nonparametric regression model for competing risks data, which, contrary to most others available in the literature, is not based on the proportional hazards assumption.     

Using recursive algorithms for the efficient identification of smoothing spline ANOVA models

In this paper we present a unified discussion of different approaches to the identification of smoothing spline analysis of variance (ANOVA) models: (i) the “classical” approach (in the line of Wahba in Spline Models for Observational Data, 1990; Gu in Smoothing Spline ANOVA Models, 2002; Storlie et al. in Stat. Sin., 2011) and (ii) the State-Dependent Regression (SDR) approach of Young in Nonlinear Dynamics and Statistics (2001). The latter is a nonparametric approach which is very similar to smoothing splines and kernel regression methods, but based on recursive filtering and smoothing estimation (the Kalman filter combined with fixed interval smoothing). We will show that SDR can be effectively combined with the “classical” approach to obtain a more accurate and efficient estimation of smoothing spline ANOVA models to be applied for emulation purposes. We will also show that such an approach can compare favorably with kriging.     

Chari Smith,Nonprofit Program Evaluation Made Simple. Get Your Data. Show Your Impact. Improve Your Programs

VOLUNTAS: International Journal of Voluntary and Nonprofit Organizations -     

Anomaly and Novelty detection for robust semi-supervised learning

Statistics and Computing - Three important issues are often encountered in Supervised and Semi-Supervised Classification: class memberships are unreliable for some training units (label noise), a...     

Wild adaptive trimming for robust estimation and cluster analysis

Trimming principles play an important role in robust statistics. However, their use for clustering typically requires some preliminary information about the contamination rate and the number of groups. We suggest a fresh approach to trimming that does not rely on this knowledge and that proves to be particularly suited for solving problems in robust cluster analysis. Our approach replaces the original K‐population (robust) estimation problem with K distinct one‐population steps, which take advantage of the good breakdown properties of trimmed estimators when the trimming level exceeds the usual bound of 0.5. In this setting, we prove that exact affine equivariance is lost on one hand but, on the other hand, an arbitrarily high breakdown point can be achieved by “anchoring” the robust estimator. We also support the use of adaptive trimming schemes, in order to infer the contamination rate from the data. A further bonus of our methodology is its ability to provide a reliable choice of the usually unknown number of groups.