Construction of closed interval for process capability indices Cpu,Cpl, and Spk based on Boole’s inequality and de Morgan’s laws

ABSTRACT

Considerable effort has been spent on the development of confidence intervals for process capability indices (PCIs) based on the sampling distribution of the PCI or the transferred PCI. However, there is still no definitive way to construct a closed interval for a PCI. The aim of this study is to develop closed intervals for the PCIs C_pu, C_pl, and S_pk based on Boole's inequality and de Morgan's laws. The relationships between different sample sizes, the significance levels, and the confidence intervals of the PCIs C_pu, C_pl, and S_pk are investigated. Then, a testing model for interval estimation for the PCIs C_pu, C_pl, and S_pk is built as a powerful tool for measuring the quality performance of a product. Finally, an applied example is given to demonstrate the effectiveness and applicability of the proposed method and the testing model.     

Percentage points of the statistics for testing hypotheses on mean vectors of multivariate normal distributions with missing observations

A problem of testing of hypotheses on the mean vector of a multivariate normal distribution with unknown and positive definite covariance matrix is considered when a sample with a special, though not unusual, pattern of missing observations from that population is available. The approximate percentage points of the test statistic are obtained and their accuracy has been checked by comparing them with some exact percentage points which are calculated for complete samples and some special incomplete samples. The approximate percentage points are in good agreement with exact percentage points. The above work is extended to the problem of testing the hypothesis of equality of two mean vectors of two multivariate normal distributions with the same, unknown covariance matrix     

Transductive versions of the LASSO and the Dantzig Selector

Transductive methods are useful in prediction problems when the training dataset is composed of a large number of unlabeled observations and a smaller number of labeled observations. In this paper, we propose an approach for developing transductive prediction procedures that are able to take advantage of the sparsity in the high dimensional linear regression. More precisely, we define transductive versions of the LASSO (Tibshirani, 1996) and the Dantzig Selector (Candès and Tao, 2007). These procedures combine labeled and unlabeled observations of the training dataset to produce a prediction for the unlabeled observations. We propose an experimental study of the transductive estimators that shows that they improve the LASSO and Dantzig Selector in many situations, and particularly in high dimensional problems when the predictors are correlated. We then provide non-asymptotic theoretical guarantees for these estimation methods. Interestingly, our theoretical results show that the Transductive LASSO and Dantzig Selector satisfy sparsity inequalities under weaker assumptions than those required for the “original” LASSO.     

A note on spectral estimation for ARMA processes

The standard frequency domain approximation to the Gaussian likelihood of a sample from an ARMA process is considered. The Newton-Raphson and Gauss-Newton numerical maximisation algorithms are evaluated for this approximate likelihood and the relationships between these algorithms and those of Akaike and Hannan explored. In particular it is shown that Hannan's method has certain computational advantages compared to the other spectral estimation methods considered     

On an asymptotic relative efficiency concept based on expected volumes of confidence regions

ABSTRACT

The paper deals with an asymptotic relative efficiency concept for confidence regions of multidimensional parameters that is based on the expected volumes of the confidence regions. Under standard conditions the asymptotic relative efficiencies of confidence regions are seen to be certain powers of the ratio of the limits of the expected volumes. These limits are explicitly derived for confidence regions associated with certain plugin estimators, likelihood ratio tests and Wald tests. Under regularity conditions, the asymptotic relative efficiency of each of these procedures with respect to each one of its competitors is equal to 1. The results are applied to multivariate normal distributions and multinomial distributions in a fairly general setting.     

Modified likelihood ratio tests in heteroskedastic multivariate regression models with measurement error

In this paper, we develop modified versions of the likelihood ratio test for multivariate heteroskedastic errors-in-variables regression models. The error terms are allowed to follow a multivariate distribution in the elliptical class of distributions, which has the normal distribution as a special case. We derive the Skovgaard-adjusted likelihood ratio statistics, which follow a chi-squared distribution with a high degree of accuracy. We conduct a simulation study and show that the proposed tests display superior finite sample behaviour as compared to the standard likelihood ratio test. We illustrate the usefulness of our results in applied settings using a data set from the WHO MONICA Project on cardiovascular disease.     

A pool-adjacent-violators-algorithm approach to detect infinite parameter estimates in one-regressor dose–response models with asymptotes

Binary response models are often applied in dose–response settings where the number of dose levels is limited. Commonly, one can find cases where the maximum likelihood estimation process for these models produces infinite values for at least one of the parameters, often corresponding to the ‘separated data’ issue. Algorithms for detecting such data have been proposed, but are usually incorporated directly into in the parameter estimation. Additionally, they do not consider the use of asymptotes in the model formulation. In order to study this phenomenon in greater detail, we define the class of specifiably degenerate functions where this can occur (including the popular logistic and Weibull models) that allows for asymptotes in the dose–response specification. We demonstrate for this class that the well-known pool-adjacent-violators algorithm can efficiently pre-screen for non-estimable data. A simulation study demonstrates the frequency with which this problem can occur for various response models and conditions.     

Modern likelihood inference for the maximum/minimum of a bivariate normal vector

ABSTRACT

We consider the use of modern likelihood asymptotics in the construction of confidence intervals for the parameter which determines the skewness of the distribution of the maximum/minimum of an exchangeable bivariate normal random vector. Simulation studies were conducted to investigate the accuracy of the proposed methods and to compare them to available alternatives. Accuracy is evaluated in terms of both coverage probability and expected length of the interval. We furthermore illustrate the suitability of our proposals by means of two data sets, consisting of, respectively, measurements taken on the brains of 10 mono-zygotic twins and measurements of mineral content of bones in the dominant and non-dominant arms for 25 elderly women.     

Implementing particle swarm optimization algorithm to estimate the mixture of two Weibull parameters with censored data

We present the maximum likelihood estimation (MLE) via particle swarm optimization (PSO) algorithm to estimate the mixture of two Weibull parameters with complete and multiple censored data. A simulation study is conducted to assess the performance of the MLE via PSO algorithm, quasi-Newton method and expectation-maximization (EM) algorithm for different parameter settings and sample sizes in both uncensored and censored cases. The simulation results showed that the PSO algorithm outperforms the quasi-Newton method and the EM algorithm in most cases regarding bias and root mean square errors. Two numerical examples are used to demonstrate the performance of our proposed method.     

LS estimation of periodic autoregressive models with non-Gaussian errors: a simulation study

In this article, the least squares (LS) estimates of the parameters of periodic autoregressive (PAR) models are investigated for various distributions of error terms via Monte-Carlo simulation. Beside the Gaussian distribution, this study covers the exponential, gamma, student-t, and Cauchy distributions. The estimates are compared for various distributions via bias and MSE criterion. The effect of other factors are also examined as the non-constancy of model orders, the non-constancy of the variances of seasonal white noise, the period length, and the length of the time series. The simulation results indicate that this method is in general robust for the estimation of AR parameters with respect to the distribution of error terms and other factors. However, the estimates of those parameters were, in some cases, noticeably poor for Cauchy distribution. It is also noticed that the variances of estimates of white noise variances are highly affected by the degree of skewness of the distribution of error terms.