Nonparametric estimation in semi-parametric univariate mixture models

We introduce new estimates of the mixing proportions, locations, and variances of the components of a finite univariate mixture model. We assume that the components are symmetric and differ only in the locations. No parametric model assumptions are imposed on the components. Further, when there is additional information available in the form of training samples that contain information concerning the mixing proportion, the new methods are robust to the symmetry assumption.     

On the distribution of rin samples from the mixtures of bivariate normal populations

The distributions of some transformations of the sample correlation coefficient r are studied here, when the parent population is a mixture of two standard bivariate normals. The behavior of these transformations is assessed through the first four standard moments. It is shown that there is a close relationship between the behavior of the transformed variables and the lack of normality as evinced by the 'kurtosis' defined in the bivariate population     

On the distribution of Fisher's transformation of the correlation coefficient

As the sample size increases, the coefficient of skewness of the Fisher's transformation, z = (1/2) log ((l+r)/(l-r)), of the correlation coefficient decreases much more rapidly than the excess of its kurtosis. Hence, the usual normal approximation for its distribution can be improved by adjusting for the excess of its kurtosis. This is accomplished by mixing the approximating normal distribution with a logistic distribution. The resulting mixture approximation which can be used to estimate the probabilities, as well as the percentiles, compares favorably in both accuracy and simplicity, with the two best earlier approximations, namely, those due to Ruben (1966) and Kraemer (1973).     

Ruin Probabilities of a Dual Markov-Modulated Risk Model

This article is devoted to studying a dual Markov-modulated risk model, which can properly represent, to some extent, surplus processes of companies that pay costs continuously and have occasional gains. We consider both the finite and infnite horizon ruin probabilities under this dual model. Upper and lower bounds of Lundberg type are derived for these ruin probabilities. We also obtain a time-dependent version of Lundberg type inequalities.     

Almost nonparametric inference for repeated measures in mixture models

We consider ways to estimate the mixing proportions in a finite mixture distribution or to estimate the number of components of the mixture distribution without making parametric assumptions about the component distributions. We require a vector of observations on each subject. This vector is mapped into a vector of 0s and 1s and summed. The resulting distribution of sums can be modelled as a mixture of binomials. We then work with the binomial mixture. The efficiency and robustness of this method are compared with the strategy of assuming multivariate normal mixtures when, typically, the true underlying mixture distribution is different. It is shown that in many cases the approach based on simple binomial mixtures is superior.     

Forecasting future values of changing sequences

Sequences of independent random variables are observed and on the basis of these observations future values of the process are forecast. The Bayesian predictive density of k future observations for normal, exponential, and binomial sequences which change exactly once are analyzed for several cases. It is seen that the Bayesian predictive densities are mixtures of standard probability distributions. For example, with normal sequences the Bayesian predictive density is a mixture of either normal or t-distributions, depending on whether or not the common variance is known. The mixing probabilities are the same as those occurring in the corresponding posterior distribution of the mean(s) of the sequence. The predictive mass function of the number of future successes that will occur in a changing Bernoulli sequence is computed and point and interval predictors are illustrated.     

An intuitive clustering algorithm for spherical data with application to extrasolar planets

This paper proposes an intuitive clustering algorithm capable of automatically self-organizing data groups based on the original data structure. Comparisons between the propopsed algorithm and EM [1 A. Banerjee, I.S. Dhillon, J. Ghosh, and S. Sra, Clustering on the unit hypersphere using von Mises–Fisher distribution, J. Mach. Learn. Res. 6 (2005), pp. 1–39. [Google Scholar]] and spherical k-means [7 I.S. Dhillon and D.S. Modha, Concept decompositions for large sparse text data using clustering, Mach. Learn. 42 (2001), pp. 143–175. doi: 10.1023/A:1007612920971[Crossref], [Web of Science ®] , [Google Scholar]] algorithms are given. These numerical results show the effectiveness of the proposed algorithm, using the correct classification rate and the adjusted Rand index as evaluation criteria [5 J.-M. Chiou and P.-L. Li, Functional clustering and identifying substructures of longitudinal data, J. R. Statist. Soc. Ser. B. 69 (2007), pp. 679–699. doi: 10.1111/j.1467-9868.2007.00605.x[Crossref] , [Google Scholar],6 J.-M. Chiou and P.-L. Li, Correlation-based functional clustering via subspace projection, J. Am. Statist. Assoc. 103 (2008), pp. 1684–1692. doi: 10.1198/016214508000000814[Taylor &; Francis Online], [Web of Science ®] , [Google Scholar]]. In 1995, Mayor and Queloz announced the detection of the first extrasolar planet (exoplanet) around a Sun-like star. Since then, observational efforts of astronomers have led to the detection of more than 1000 exoplanets. These discoveries may provide important information for understanding the formation and evolution of planetary systems. The proposed clustering algorithm is therefore used to study the data gathered on exoplanets. Two main implications are also suggested: (1) there are three major clusters, which correspond to the exoplanets in the regimes of disc, ongoing tidal and tidal interactions, respectively, and (2) the stellar metallicity does not play a key role in exoplanet migration.     

A Thresholding Algorithm for Order Selection in Finite Mixture Models

Order selection is an important step in the application of finite mixture models. Classical methods such as AIC and BIC discourage complex models with a penalty directly proportional to the number of mixing components. In contrast, Chen and Khalili propose to link the penalty to two types of overfitting. In particular, they introduce a regularization penalty to merge similar subpopulations in a mixture model, where the shrinkage idea of regularized regression is seamlessly employed. However, the new method requires an effective and efficient algorithm. When the popular expectation-maximization (EM)-algorithm is used, we need to maximize a nonsmooth and nonconcave objective function in the M-step, which is computationally challenging. In this article, we show that such an objective function can be transformed into a sum of univariate auxiliary functions. We then design an iterative thresholding descent algorithm (ITD) to efficiently solve the associated optimization problem. Unlike many existing numerical approaches, the new algorithm leads to sparse solutions and thereby avoids undesirable ad hoc steps. We establish the convergence of the ITD and further assess its empirical performance using both simulations and real data examples.     

BAYESIAN ESTIMATION OF RUIN PROBABILITIES WITH A HETEROGENEOUS AND HEAVY-TAILED INSURANCE CLAIM-SIZE DISTRIBUTION

This paper describes a Bayesian approach to make inference for risk reserve processes with an unknown claim‐size distribution. A flexible model based on mixtures of Erlang distributions is proposed to approximate the special features frequently observed in insurance claim sizes, such as long tails and heterogeneity. A Bayesian density estimation approach for the claim sizes is implemented using reversible jump Markov chain Monte Carlo methods. An advantage of the considered mixture model is that it belongs to the class of phase‐type distributions, and thus explicit evaluations of the ruin probabilities are possible. Furthermore, from a statistical point of view, the parametric structure of the mixtures of the Erlang distribution offers some advantages compared with the whole over‐parametrized family of phase‐type distributions. Given the observed claim arrivals and claim sizes, we show how to estimate the ruin probabilities, as a function of the initial capital, and predictive intervals that give a measure of the uncertainty in the estimations.     

Bias-calibrated estimation from sample surveys containing outliers

We discuss the problem of estimating finite population parameters on the basis of a sample containing representative outliers. We clarify the motivation for Chambers's bias-calibrated estimator of the population total and show that bias calibration is a key idea in constructing estimators of finite population parameters. We then link the problem of estimating the population total to distribution function or quantile estimation and explore a methodology based on the use of Chambers's estimator. We also propose methodology based on the use of robust estimates and a bias-calibrated form of the Chambers and Dunstan estimator of the population distribution function. This proposal leads to a bias-calibrated estimator of the population total which is an alternative to that of Chambers. We present a small simulation study to illustrate the utility of these estimators.