Designing of variables quick switching sampling system by considering process loss functions

This paper proposes a variables quick switching system where the quality characteristic of interest follows a normal distribution and the quality characteristic is evaluated through a process loss function. Most of the variables sampling plans available in the literature focus only on the fraction non-conforming and those plans do not distinguish between the products that fall within the specification limits. The products that fall within specification limits may not be good if their mean is too away from the target value. So developing a sampling plan by considering process loss is inevitable in these situations. Based on this idea, we develop a variables quick switching system based on the process loss function for the application of the processes requiring low process loss. Tables are also constructed for the selection of parameters of variables quick switching system for given acceptable quality level and limiting quality level. The results are explained with examples.     

A process capability index that is based on the proportion of conformance

In this paper a new process capability index is proposed, which is based on the proportion of conformance of the process and has several appealing features. This index is simple in its assessment and interpretation and is applicable to normally or non-normally distributed processes. Likewise, its value can be assessed for continuous or discrete processes, it can be used under either unilateral or bilateral tolerances and the assessment of confidence limits for its true value is not very involved, under specific distributional assumptions. Point estimators and confidence limits for this index are investigated, assuming two very common continuous distributions (normal and exponential).     

Combined continuous lot by lot acceptance sampling plan

For production processes involving low fraction non-conforming, the sample sizes of the usual attribute inspection plans are very large. A continuous sampling plan for such processes would also require either a large clearance interval or a large sampling fraction. This paper simplifies the approach of combining the lot by lot and continuous sampling plans recommended by Pesotchinsky (1987) and provides various performance measures for the combined plan. A discussion of the choice of the parameters is also given.     

Robust multivariate mixture regression models with incomplete data

Multivariate mixture regression models can be used to investigate the relationships between two or more response variables and a set of predictor variables by taking into consideration unobserved population heterogeneity. It is common to take multivariate normal distributions as mixing components, but this mixing model is sensitive to heavy-tailed errors and outliers. Although normal mixture models can approximate any distribution in principle, the number of components needed to account for heavy-tailed distributions can be very large. Mixture regression models based on the multivariate t distributions can be considered as a robust alternative approach. Missing data are inevitable in many situations and parameter estimates could be biased if the missing values are not handled properly. In this paper, we propose a multivariate t mixture regression model with missing information to model heterogeneity in regression function in the presence of outliers and missing values. Along with the robust parameter estimation, our proposed method can be used for (i) visualization of the partial correlation between response variables across latent classes and heterogeneous regressions, and (ii) outlier detection and robust clustering even under the presence of missing values. We also propose a multivariate t mixture regression model using MM-estimation with missing information that is robust to high-leverage outliers. The proposed methodologies are illustrated through simulation studies and real data analysis.     

Regression via order statistics and their concomitants

We consider a five-dimensional normal distribution and derive the exact joint distribution one variable, linear combinations of order statistics from two other variables, and linear combinations of the corresponding concomitants of these order statistics. We show that this joint distribution is a mixture of trivariate unified skew-normal distributions. This mixture representation enables us to predict one variable based on linear combinations of order statistics from two other variables and linear combinations of the corresponding concomitants. We finally illustrate the usefulness of these results by using a real data.     

In Memoriam: Bernard George Greenberg 1919-1985

The bivariate normal density with unit variance and correlation ρ is well known. We show that by integrating out ρ, the result is a function of the maximum norm. The Bayesian interpretation of this result is that if we put a uniform prior over ρ, then the marginal bivariate density depends only on the maximal magnitude of the variables. The square-shaped isodensity contour of this resulting marginal bivariate density can also be regarded as the equally weighted mixture of bivariate normal distributions over all possible correlation coefficients. This density links to the Khintchine mixture method of generating random variables. We use this method to construct the higher dimensional generalizations of this distribution. We further show that for each dimension, there is a unique multivariate density that is a differentiable function of the maximum norm and is marginally normal, and the bivariate density from the integral over ρ is its special case in two dimensions.     

A comparison of methods forsing loss-based capability index

The process capability index C _pm, sometimes called the loss-based index, has been proposed to the manufacturing industry for measuring process reproduction capability. This index incorporates the variation of production items with respect to the target value and the specification limits preset in the factory. To estimate the loss-based index properly and accurately, certain frequentist and Bayesian perspectives have been proposed to obtain lower confidence bounds (LCBs) for providing minimum process capability. The LCBs not only provide critical information regarding process performance but are also used to determine whether an improvement was made in a capability index and by extension in reducing the fraction of non-conforming items. In this paper, under the assumption of normality, based on frequentist and Bayesian senses, several existing approaches for constructing LCBs of C _pm are presented. Depending on the statistical methods used, we then classify these existing approaches into three categories and compared them in terms of the coverage rates and the mean values of the LCBs via simulations. The relative advantages and disadvantages of these approaches are summarized with some highlights of the relevant findings.     

SB-robustness of directional mean for circular distributions

In this paper we study the robustness of the directional mean (a.k.a. circular mean) for different families of circular distributions. We show that the directional mean is robust in the sense of finite standardized gross error sensitivity (SB-robust) for the following families: (1) mixture of two circular normal distributions, (2) mixture of wrapped normal and circular normal distributions and (3) mixture of two wrapped normal distributions. We also show that the directional mean is not SB-robust for the family of all circular normal distributions with varying concentration parameter. We define the circular trimmed mean and prove that it is SB-robust for this family. In general the property of SB-robustness of an estimator at a family of probability distributions is dependent on the choice of the dispersion measure. We introduce the concept of equivalent dispersion measures and prove that if an estimator is SB-robust for one dispersion measure then it is SB-robust for all equivalent dispersion measures. Three different dispersion measures for circular distributions are considered and their equivalence studied.     

Skewness and mixtures of normal distributions

The effect of skewness on hypothesis tests for the existence of a mixture of univariate and bivariate normal distributions is examined through a Monte Carlo study. A likelihood ratio test based on results of the simultaneous estimation of skewness parameters, derived from power transformations, with mixture parameters is proposed. This procedure detects the difference between inherent distributional skewness and the apparent skewness which is a manifestation of the mixture of several distributions. The properties of this test are explored through a simulation study.     

Efficient Bayesian inference in generalized inverse gamma processes for stochastic volatility

This paper develops a novel and efficient algorithm for Bayesian inference in inverse Gamma stochastic volatility models. It is shown that by conditioning on auxiliary variables, it is possible to sample all the volatilities jointly directly from their posterior conditional density, using simple and easy to draw from distributions. Furthermore, this paper develops a generalized inverse gamma process with more flexible tails in the distribution of volatilities, which still allows for simple and efficient calculations. Using several macroeconomic and financial datasets, it is shown that the inverse gamma and generalized inverse gamma processes can greatly outperform the commonly used log normal volatility processes with Student’s t errors or jumps in the mean equation.     

Effects of correlation on fraction non-conforming statistical process control procedures

High-yield production processes that involve a low fraction non-conforming are becoming more common, and the limitations of the standard control charting procedures for such processes are well known. This paper examines the control procedures based on the conforming unit run lengths applied to near-zero-defect processes in the presence of serial correlation. Using a correlation binomial model, a few control schemes are investigated and control limits are derived. The results reduce to the traditional case when the measurements are independent. However, it is shown that the false alarm rate cannot be reduced to below the amount of serial correlation present in the process.     

Finite mixtures of matrix normal distributions for classifying three-way data

Matrix-variate distributions represent a natural way for modeling random matrices. Realizations from random matrices are generated by the simultaneous observation of variables in different situations or locations, and are commonly arranged in three-way data structures. Among the matrix-variate distributions, the matrix normal density plays the same pivotal role as the multivariate normal distribution in the family of multivariate distributions. In this work we define and explore finite mixtures of matrix normals. An EM algorithm for the model estimation is developed and some useful properties are demonstrated. We finally show that the proposed mixture model can be a powerful tool for classifying three-way data both in supervised and unsupervised problems. A simulation study and some real examples are presented.     

A comparative study of the K-means algorithm and the normal mixture model for clustering: Bivariate homoscedastic case

The K-means algorithm and the normal mixture model method are two common clustering methods. The K-means algorithm is a popular heuristic approach which gives reasonable clustering results if the component clusters are ball-shaped. Currently, there are no analytical results for this algorithm if the component distributions deviate from the ball-shape. This paper analytically studies how the K-means algorithm changes its classification rule as the normal component distributions become more elongated under the homoscedastic assumption and compares this rule with that of the Bayes rule from the mixture model method. We show that the classification rules of both methods are linear, but the slopes of the two classification lines change in the opposite direction as the component distributions become more elongated. The classification performance of the K-means algorithm is then compared to that of the mixture model method via simulation. The comparison, which is limited to two clusters, shows that the K-means algorithm provides poor classification performances consistently as the component distributions become more elongated while the mixture model method can potentially, but not necessarily, take advantage of this change and provide a much better classification performance.     

Mixtures of Gaussian copula factor analyzers for clustering high dimensional data

Mixtures of factor analyzers is a useful model-based clustering method which can avoid the curse of dimensionality in high-dimensional clustering. However, this approach is sensitive to both diverse non-normalities of marginal variables and outliers, which are commonly observed in multivariate experiments. We propose mixtures of Gaussian copula factor analyzers (MGCFA) for clustering high-dimensional clustering. This model has two advantages; (1) it allows different marginal distributions to facilitate fitting flexibility of the mixture model, (2) it can avoid the curse of dimensionality by embedding the factor-analytic structure in the component-correlation matrices of the mixture distribution.An EM algorithm is developed for the fitting of MGCFA. The proposed method is free of the curse of dimensionality and allows any parametric marginal distribution which fits best to the data. It is applied to both synthetic data and a microarray gene expression data for clustering and shows its better performance over several existing methods.     

Characterization of a mixture of gamma distributions via conditional finite moments

A necessary and sufficient condition that a continuous, positive random variable follow a gamma distribution is given in terms of any one of its conditional finite moments and an expression involving its failure rate. The results are then used to develop a characterization for a mixture of two gamma distributions. The general results about characterization of a mixture of gamma distributions yield several special cases that have appeared separately in recent literature, including characterization of a single exponential distribution, characterization of a single gamma distribution (in terms of either first or second moments) and a sufficient condition for a mixture of two exponential distributions (in terms of first moments). The condition in this last result is shown to be necessary also. Numerous other cases are possible, using different choices for distribution parameters along with a selection of the mixing parameter, for either individual or mixtures of distributions. Various characterizations can be expressed using higher order moments, too.     

Inferences in dichotomous classifications with misclassifications based on sequential repetitive classifications

To create inferences in dichotomous classifications with misclassifications and possibly perform repeated classifications, the maximum likelihood method is commonly used, mainly because of its efficiency in obtaining parameter estimators of a mixture of two binomial distributions. One simpler alternative that is operationally easier is to consider the simple majority method. In this method, each of n items are classified r times as conforming or non-conforming. The final classification of the item is determined by the most frequent class. This method yielded lower mean squared errors than the maximum likelihood and the moments estimators and is asymptotically efficient. In this paper, we introduce a new approach in which the realization of all r repeated classifications of each item may not be needed. Each of n items is sequentially classified as conforming or nonconforming, and the process ceases when the frequency of conforming or non-conforming classification reaches the integer a. We show that, by a Monte Carlo simulation, the last procedure presents a lower mean squared error than the simple majority results for a similar number of r repeated classifications.     

A Monte Carlo Markov chain algorithm for a class of mixture time series models

This article generalizes the Monte Carlo Markov Chain (MCMC) algorithm, based on the Gibbs weighted Chinese restaurant (gWCR) process algorithm, for a class of kernel mixture of time series models over the Dirichlet process. This class of models is an extension of Lo’s (Ann. Stat. 12:351–357, 1984) kernel mixture model for independent observations. The kernel represents a known distribution of time series conditional on past time series and both present and past latent variables. The latent variables are independent samples from a Dirichlet process, which is a random discrete (almost surely) distribution. This class of models includes an infinite mixture of autoregressive processes and an infinite mixture of generalized autoregressive conditional heteroskedasticity (GARCH) processes.     

Development and comparative study of two near-exact approximations to the distribution of the product of an odd number of independent Beta random variables

Using the concept of near-exact approximation to a distribution we developed two different near-exact approximations to the distribution of the product of an odd number of particular independent Beta random variables (r.v.'s). One of them is a particular generalized near-integer Gamma (GNIG) distribution and the other is a mixture of two GNIG distributions. These near-exact distributions are mostly adequate to be used as a basis for approximations of distributions of several statistics used in multivariate analysis. By factoring the characteristic function (c.f.) of the logarithm of the product of the Beta r.v.'s, and then replacing a suitably chosen factor of that c.f. by an adequate asymptotic result it is possible to obtain what we call a near-exact c.f., which gives rise to the near-exact approximation to the exact distribution. Depending on the asymptotic result used to replace the chosen parts of the c.f., one may obtain different near-exact approximations. Moments from the two near-exact approximations developed are compared with the exact ones. The two approximations are also compared with each other, namely in terms of moments and quantiles.     

Two new defective distributions based on the Marshall–Olkin extension

The presence of immune elements (generating a fraction of cure) in survival data is common. These cases are usually modeled by the standard mixture model. Here, we use an alternative approach based on defective distributions. Defective distributions are characterized by having density functions that integrate to values less than \(1\), when the domain of their parameters is different from the usual one. We use the Marshall–Olkin class of distributions to generalize two existing defective distributions, therefore generating two new defective distributions. We illustrate the distributions using three real data sets.     

A Note on an Approximation of the Mobile Communications Expenditures Distribution Function Using a Mixture Model

Approximating the distribution of mobile communications expenditures (MCE) is complicated by zero observations in the sample. To deal with the zero observations by allowing a point mass at zero, a mixture model of MCE distributions is proposed and applied. The MCE distribution is specified as a mixture of two distributions, one with a point mass at zero and the other with full support on the positive half of the real line. The model is empirically verified for individual MCE survey data collected in Seoul, Korea. The mixture model can easily capture the common bimodality feature of the MCE distribution. In addition, when covariates were added to the model, it was found that the probability that an individual has non-expenditure significantly varies with some variables. Finally, the goodness-of-fit test suggests that the data are well represented by the mixture model.