On exact and optimal single-sampling plans by variables

We deal with sampling by variables with two-way protection in the case of a $N\>(\mu ,\sigma ^2)$ distributed characteristic with unknown $\sigma $ . The LR sampling plan proposed by Lieberman and Resnikoff (JASA 50: 457 ${-}$ 516, 1955) and the BSK sampling plan proposed by Bruhn-Suhr and Krumbholz (Stat. Papers 31: 195–207, 1990) are based on the UMVU and the plug-in estimator, respectively. For given $p_1$ (AQL), $p_2$ (RQL) and $\alpha ,\beta $ (type I and II errors) we present an algorithm allowing to determine the optimal LR and BSK plans having minimal sample size among all plans satisfying the corresponding two-point condition on the OC. An R (R: A language and environment for statistical computing, R Foundation for Statistical Computing, Vienna, Austria. ISBN 3-900051-07-0, URL http://www.R-project.org/ 2012) package, ExLiebeRes‘ (Krumbholz and Steuer ExLiebeRes: calculating exact LR- and BSK-plans, R-package version 0.9.9. http://exlieberes.r-forge.r-project.org 2012) implementing that algorithm is provided to the public.     

A unified class of penalties with the capability of producing a differentiable alternative to l1 norm penalty

Abstract

This article presents a class of novel penalties that are defined under a unified framework, which includes lasso, SCAD and ridge as special cases, and novel functions, such as the asymmetric quantile check function. The proposed class of penalties is capable of producing alternative differentiable penalties to lasso. We mainly focus on this case and show its desirable properties, propose an efficient algorithm for the parameter estimation and prove the theoretical properties of the resulting estimators. Moreover, we exploit the differentiability of the penalty function by deriving a novel Generalized Information Criterion (GIC) for model selection. The method is implemented in the R package DLASSO freely available from CRAN, http://CRAN.R-project.org/package=DLASSO.     

Nonparametric multiple expectile regression via ER-Boost

Expectile regression [Newey W, Powell J. Asymmetric least squares estimation and testing, Econometrica. 1987;55:819–847] is a nice tool for estimating the conditional expectiles of a response variable given a set of covariates. Expectile regression at 50% level is the classical conditional mean regression. In many real applications having multiple expectiles at different levels provides a more complete picture of the conditional distribution of the response variable. Multiple linear expectile regression model has been well studied [Newey W, Powell J. Asymmetric least squares estimation and testing, Econometrica. 1987;55:819–847; Efron B. Regression percentiles using asymmetric squared error loss, Stat Sin. 1991;1(93):125.], but it can be too restrictive for many real applications. In this paper, we derive a regression tree-based gradient boosting estimator for nonparametric multiple expectile regression. The new estimator, referred to as ER-Boost, is implemented in an R package erboost publicly available at http://cran.r-project.org/web/packages/erboost/index.html. We use two homoscedastic/heteroscedastic random-function-generator models in simulation to show the high predictive accuracy of ER-Boost. As an application, we apply ER-Boost to analyse North Carolina County crime data. From the nonparametric expectile regression analysis of this dataset, we draw several interesting conclusions that are consistent with the previous study using the economic model of crime. This real data example also provides a good demonstration of some nice features of ER-Boost, such as its ability to handle different types of covariates and its model interpretation tools.     

Hip fracture prediction from a new classification algorithm based on recursive partitioning methods

Classification and regression tree has been useful in medical research to construct algorithms for disease diagnosis or prognostic prediction. Jin et al. 7 Jin, H., Lu, Y., Harris, R. T., Black, D., Stone, K., Hochberg, M. and Genant, H. 2004. Classification algorithms for hip fracture prediction base on recursive partitioning methods. Med. Decis. Mak., 24: 386–398. (doi:10.1177/0272989X04267009)[Crossref], [PubMed], [Web of Science ®] , [Google Scholar] developed a robust and cost-saving tree (RACT) algorithm with application in classification of hip fracture risk after 5-year follow-up based on the data from the Study of Osteoporotic Fractures (SOF). Although conventional recursive partitioning algorithms have been well developed, they still have some limitations. Binary splits may generate a big tree with many layers, but trinary splits may produce too many nodes. In this paper, we propose a classification approach combining trinary splits and binary splits to generate a trinary–binary tree. A new non-inferiority test of entropy is used to select the binary or trinary splits. We apply the modified method in SOF to construct a trinary–binary classification rule for predicting risk of osteoporotic hip fracture. Our new classification tree has good statistical utility: it is statistically non-inferior to the optimum binary tree and the RACT based on the testing sample and is also cost-saving. It may be useful in clinical applications: femoral neck bone mineral density, age, height loss and weight gain since age 25 can identify subjects with elevated 5-year hip fracture risk without loss of statistical efficiency.     

Statistical Analysis Of Cometary Data

In this study an attempt is made to assess statistically the validity of two theories as to the origin of comets. This subject still leads to great controversy amongst astronomers but recently two main schools of thought have developed.

These are that comets are of

(i) planetary origin,

(ii) interstellar origin.

Many theories have been expanded within each school of thought but at the present time one theory in each is generally accepted. This paper sets out to identify the statistical implications of each theory and evaluate each theory in terms of their implications.     

Is there an alternative to the european farm typology?

The 1978 European Community Typology for Agricultural Holdings is described in this paper and contrasted with a data based, polythetic-multivariate classification based on cluster analysis.

The requirement to reduce the size of the variable set employed in an optimisation-partition method of clustering suggested the value of principal components and factor analysis for the identification of major ‘source’ dimensions against which to measure farm differences and similarities.

The Euclidean cluster analysis incorporating the reduced dimensions quickly converged to a stable solution and was little influenced by the initial number or nature of ‘seeding’ partitions of the data.

The assignment of non-sampled observations from the population to cluster classes was completed using classification functions.

The final scheme, based on a sample of over 2,000 observations, was found to be both capable of interpretation and meaningful in terms of agricultural structure and practice and much superior in its explanatory power when compared with a version of the principal activity typology.     

Throughput and delay analysis of an opportunistic tree algorithm

Tree algorithms are a well-known class of random access algorithms with a provable maximum stable throughput under the infinite population model (as opposed to ALOHA or the binary exponential backoff algorithm). In this article, we propose a tree algorithm for opportunistic spectrum usage in cognitive radio networks. A channel in such a network is shared among so-called primary and secondary users, where the secondary users are allowed to use the channel only if there is no primary user activity. The tree algorithm designed in this article can be used by the secondary users to share the channel capacity left by the primary users.

We analyze the maximum stable throughput and mean packet delay of the secondary users by developing a tree structured Quasi-Birth Death Markov chain under the assumption that the primary user activity can be modeled by means of a finite state Markov chain and that packets lengths follow a discrete phase-type distribution.

Numerical experiments provide insight on the effect of various system parameters and indicate that the proposed algorithm is able to make good use of the bandwidth left by the primary users.     

On extremal behavior of aggregation of largest claims

In this paper some dependent risks are considered, and tail asymptotic probabilities for linear combinations of finite number or random number of randomly weighted order statistics are estimated under various assumptions, where the primary random variables have long and dominatedly varying tails. Our findings are highly motivated by the need of the investigation of extremal behavior of aggregation of large claims, which has been shown in Asimit et al. (2012) Asimit, A.V., Hashorva, E., Kortschak, D. (2012). Exact tail asymptotics of the total loss of largest claim reinsurance treaties. Available at SSRN: http://ssrn.com/abstract=1993114 or http://dx.doi.org/10.2139/ssrn.1993114. [Google Scholar].     

Modelling the quality of work in the Italian social co-operatives combining NPCA-RSM and SEM-GME approaches

The objective of this paper is to describe and analyse with appropriate statistical models the links between work quality latent factors. Due to the complexity of the task, the analysis is carried out through a two-step approach:

• In the first step, we construct some multidimensional measures of the subjective quality of work, using nonlinear principal component analysis (NPCA) and Rasch analysis with the Rating Scale Model (NPCA-RSM);

• In the second step, we adopt a Structural Equation Model based on generalized maximum entropy (SEM-GME) to integrate the measures achieved with the previous step and to evaluate the relationships between the subjective work quality latent factors.

Therefore, the novel aspects of this paper are the following: (i) The integration between the NPCA-RSM and SEM-GME, which allows reduction of the variables analysed and evaluation of the measurement errors; (ii) The formalization of a Job Satisfaction Model for the study of the relationships between the subjective work quality latent factors in the Italian social services sector.     

Parameter estimation of Cambanis-type bivariate uniform distribution with Ranked Set Sampling

The concept of ranked set sampling (RSS) is applicable whenever ranking on a set of sampling units can be done easily using a judgment method or based on an auxiliary variable. In this paper, we consider a study variable Y correlated with the auxiliary variable X and use it to rank the sampling units. Further (X,Y) is assumed to have Cambanis-type bivariate uniform (CTBU) distribution. We obtain an unbiased estimator of a scale parameter associated with the study variable Y based on different RSS schemes. We perform the efficiency comparison of the proposed estimators numerically. We present the trends in the efficiency performance of estimators under various RSS schemes with respect to parameters through line and surface plots. Further, we develop a Matlab function to simulate data from CTBU distribution and present the performance of proposed estimators through a simulation study. The results developed are implemented to real-life data also.KEYWORDS: Ranked set sampling, concomitants of order statistics, Cambanis-type bivariate uniform distribution, best linear unbiased estimatorSUBJECT CLASSIFICATIONS: 62D05, 62F07, 62G30     

EM algorithm for mixture of skew-normal distributions fitted to grouped data

Grouped data are frequently used in several fields of study. In this work, we use the expectation-maximization (EM) algorithm for fitting the skew-normal (SN) mixture model to the grouped data. Implementing the EM algorithm requires computing the one-dimensional integrals for each group or class. Our simulation study and real data analyses reveal that the EM algorithm not only always converges but also can be implemented in just a few seconds even when the number of components is large, contrary to the Bayesian paradigm that is computationally expensive. The accuracy of the EM algorithm and superiority of the SN mixture model over the traditional normal mixture model in modelling grouped data are demonstrated through the simulation and three real data illustrations. For implementing the EM algorithm, we use the package called ForestFit developed for R environment available at https://cran.r-project.org/web/packages/ForestFit/index.html.     

A Generalization of Hotelling's T 2

ABSTRACT

We derive an asymptotic version of Hotelling's T ² for the multivariate proper dispersion models of Jøtrgensen and Lauritzen (2000 Jørgensen , B. , Lauritzen , S. L. ( 2000 ). Multivariate dispersion models . J. Multivariate Anal. 74 : 267 – 281 . [CSA] [CROSSREF]  [Google Scholar]), the main tool being the saddlepoint approximation. Multivariate dispersion models are suitable for positive, directional, compositional, and other non normal data. We illustrate the results by a multivariate gamma model.     

Implicit Estimation for the Stochastic Volatility Model

Efficient, accurate, and fast Markov Chain Monte Carlo estimation methods based on the Implicit approach are proposed. In this article, we introduced the notion of Implicit method for the estimation of parameters in Stochastic Volatility models.

Implicit estimation offers a substantial computational advantage for learning from observations without prior knowledge and thus provides a good alternative to classical inference in Bayesian method when priors are missing.

Both Implicit and Bayesian approach are illustrated using simulated data and are applied to analyze daily stock returns data on CAC40 index.     

The Design of Scoring Schemes for Surveys Using the Block Total Response Method

ABSTRACT

In this article we investigate the design of scoring schemes for surveys using the block total response method. This method was first proposed by Raghavarao and Federer (1979 Raghavarao , D. , Federer , W. T. ( 1979 ). Block total response as an alternative to the randomized response method in surveys . J. Roy. Statist. Soc. 41 ( 1 ): 40 – 45 . [CSA] [CROSSREF]  [Google Scholar]) to provide accurate estimates of the base rates of sensitive characteristics using balanced incomplete block designs. The scoring scheme used in Raghavarao and Federer (1979 Raghavarao , D. , Federer , W. T. ( 1979 ). Block total response as an alternative to the randomized response method in surveys . J. Roy. Statist. Soc. 41 ( 1 ): 40 – 45 . [CSA] [CROSSREF]  [Google Scholar]) did not guarantee anonymity of answers and so the possibility of improving on this basic scoring scheme is considered in this article.     

Stratification: Measuring and Inference

ABSTRACT

Stratification of distribution functions is an important issue in the area of income distributions. Two distribution functions form a perfect stratification if they occupy disjoint ranges on the horizontal axis. Otherwise, there is overlapping. A measure which quantifies the amount of stratification is introduced by Yitzhaki (1994 Yitzhaki , S. ( 1994 ). Economic distance and overlapping of distributions . J. Econometrics 61 : 147 – 159 . [CSA] [CROSSREF] [Crossref], [Web of Science ®] , [Google Scholar]), but no procedure for drawing inference is suggested. We develop a consistent estimator of the degree of overlapping and offer a nonparametric procedure for inference. Its limiting distribution, properly standardized, is normal. The asymptotic variance can be estimated using the jackknife method, and simulations show that the suggested procedure works well for sample sizes of 50 (100 for some cases).