Multivariate attribute control chart using Mahalanobis D2 statistic

Process control involves repeated hypothesis testing based on several samples. However, process control is not exactly hypothesis testing as such since it deals with detection of non-random patterns of variation as well in a fleeting kind of population. Compare this with hypothesis testing which is principally meant for a stagnant population. Dr Walter A. Shewhart introduced a graphic method for doing this testing in a fleeting population in 1924. This graphic method came to be known as control chart and is widely used throughout the world today for process management purposes. Subsequently there was much advancement in process control techniques. In particular, when more than one variable was involved, process control techniques were developed mainly by Hicks (1955), Jackson (1956 and 1959) and Montgomery and Wadsworth (1972) based on the pioneering work of Hotelling in 1931. Most of them have worked in the area of multivariate variable control chart with the underlying distribution as multivariate normal. When more than one attribute variables are involved some works relating to test of hypothesis was done by Mahalanobis (1946). These works were also based on the Hotelling T² test. This paper expands the concept of 'Mahalanobis Distance' in case of a multinomial distribution and thereby proposes a multivariate attribute control chart.     

Identification of local clusters for count data: a model-based Moran's I test

We set out I_DR as a loglinear-model-based Moran's I test for Poisson count data that resembles the Moran's I residual test for Gaussian data. We evaluate its type I and type II error probabilities via simulations, and demonstrate its utility via a case study. When population sizes are heterogeneous, I_DR is effective in detecting local clusters by local association terms with an acceptable type I error probability. When used in conjunction with local spatial association terms in loglinear models, I_DR can also indicate the existence of first-order global cluster that can hardly be removed by local spatial association terms. In this situation, I_DR should not be directly applied for local cluster detection. In the case study of St. Louis homicides, we bridge loglinear model methods for parameter estimation to exploratory data analysis, so that a uniform association term can be defined with spatially varied contributions among spatial neighbors. The method makes use of exploratory tools such as Moran's I scatter plots and residual plots to evaluate the magnitude of deviance residuals, and it is effective to model the shape, the elevation and the magnitude of a local cluster in the model-based test.     

A fast general extension algorithm of Latin hypercube sampling

A fast general extension algorithm of Latin hypercube sampling (LHS) is proposed, which reduces the time consumption of basic general extension and preserves the most original sampling points. The extension algorithm starts with an original LHS of size m and constructs a new LHS of size m?+?n that remains the original points. This algorithm is the further research of basic general extension, which cost too much time to get the new LHS. During selecting the original sampling points to preserve, time consumption is cut from three aspects. The first measure of the proposed algorithm is to select isolated vertices and divide the adjacent matrix into blocks. Secondly, the relationship of original LHS structure and new LHS structure is discussed. Thirdly, the upper and lower bounds help reduce the time consumption. The proposed algorithm is applied for two functions to demonstrate the effectiveness.     

Decision-theoretic estimation of generalized variance and generalized precision

Consider a random data matrix X=(X₁,...,X_k):pXk with independent columns [sathik] and an independent p X p Wishart matrix [sathik]. Estimators dominating the best affine equivariant estimators of [sathik] are obtained under four types of loss functions. Improved estimators (Testimators) of generalized variance and generalized precision are also considered under convex entropy loss (CEL).     

Contingency tables with structural zeros

In this paper, the method of Hocking and Oxspring (1971) to estimate multinomial probabilities when full and partial data are available for some cells is extended to estimate the cell probabilities of a contingency table with structural zeros. The estimates are maximum likelihood, and the process is sequential. The gain in precision is due to the use of partial data and the bias of the estimates is also investigated.     

Variance least squares estimators for multivariate linear mixed model

Non-iterative, distribution-free, and unbiased estimators of variance components by least squares method are derived for multivariate linear mixed model. A general inter-cluster variance matrix, a same-member only general inter-response variance matrix, and an uncorrelated intra-cluster error structure for each response are assumed. Projection method is suggested when unbiased estimators of variance components are not nonnegative definite matrices. A simulation study is conducted to investigate the properties of the proposed estimators in terms of bias and mean square error with comparison to the Gaussian (restricted) maximum likelihood estimators. The proposed estimators are illustrated by an application of gene expression familial study.     

A Multiplicative Alo-group Based Hierarchical Decision Model and Application

Pairwise comparison matrix (PCM) is a popular technique used in multi-criteria decision making. The abelian linearly ordered group (alo-group) is a powerful tool for the discussion of PCMs. In this article, a criterion for acceptable consistency of PCM is introduced, which is independent of the scale and can be intuitively interpreted. The relation of the introduced criterion with the weak consistency is investigated. Then, a multiplicative alo-group based hierarchical decision model is proposed. The following approaches are included: (1) the introduced criterion for acceptable consistency is used to check whether or not a PCM is acceptable; (2) the row’s geometric mean method is used for deriving the local priorities of a multiplicative PCM; (3) a Hierarchy Composition Rule derived from the weighted mean is used for computing the criterion/subcriterion’s weights with regard to the total goal; and (4) the weighted geometric mean is used as the aggregation rule, where the alternative’s local priorities are min-normalized. The proposed model has the property of preserving rank. Moreover, it has counterparts in the additive case. Finally, the model is applied to a layout planning problem of an aircraft maintenance base with a computer-based software.     

Sampling distributions of kruskal's measure of stress for an asymmetric matrix

In the past ten years multidimensional scaling of nonmetric data has been widely applied in behavioral and business research. This paper investigates the asymmetric data matrix and develops stress distributions based upon a null hypothesis of equal like­lihood in the ranking of a set of proximities.     

Label‐ and Level‐Invariant Graphical Log‐Linear Models

We introduce two types of graphical log‐linear models: label‐ and level‐invariant models for triangle‐free graphs. These models generalise symmetry concepts in graphical log‐linear models and provide a tool with which to model symmetry in the discrete case. A label‐invariant model is category‐invariant and is preserved after permuting some of the vertices according to transformations that maintain the graph, whereas a level‐invariant model equates expected frequencies according to a given set of permutations. These new models can both be seen as instances of a new type of graphical log‐linear model termed the restricted graphical log‐linear model, or RGLL, in which equality restrictions on subsets of main effects and first‐order interactions are imposed. Their likelihood equations and graphical representation can be obtained from those derived for the RGLL models.     

Rank covariance matrix estimation of a partially known covariance matrix

Classical multivariate methods are often based on the sample covariance matrix, which is very sensitive to outlying observations. One alternative to the covariance matrix is the affine equivariant rank covariance matrix (RCM) that has been studied in Visuri et al. [2003. Affine equivariant multivariate rank methods. J. Statist. Plann. Inference 114, 161–185]. In this article we assume that the covariance matrix is partially known and study how to estimate the corresponding RCM. We use the properties that the RCM is affine equivariant and that the RCM is proportional to the inverse of the regular covariance matrix, and hence reduce the problem of estimating the original RCM to estimating marginal rank covariance matrices. This is a great computational advantage when the dimension of the original data vector is large.