A general method of constructing E(s2)-optimal supersaturated designs

There has been much recent interest in supersaturated designs and their application in factor screening experiments. Supersaturated designs have mainly been constructed by using the E ( s ²)-optimality criterion originally proposed by Booth and Cox in 1962. However, until now E ( s ²)-optimal designs have only been established with certainty for n experimental runs when the number of factors m is a multiple of n-1 , and in adjacent cases where m = q ( n -1) + r (| r | 2, q an integer). A method of constructing E ( s ²)-optimal designs is presented which allows a reasonably complete solution to be found for various numbers of runs n including n ,=8 12, 16, 20, 24, 32, 40, 48, 64.     

Approximate Bayesian inference for latent Gaussian models by using integrated nested Laplace approximations

Summary.  Structured additive regression models are perhaps the most commonly used class of models in statistical applications. It includes, among others, (generalized) linear models, (generalized) additive models, smoothing spline models, state space models, semiparametric regression, spatial and spatiotemporal models, log-Gaussian Cox processes and geostatistical and geoadditive models. We consider approximate Bayesian inference in a popular subset of structured additive regression models, latent Gaussian models , where the latent field is Gaussian, controlled by a few hyperparameters and with non-Gaussian response variables. The posterior marginals are not available in closed form owing to the non-Gaussian response variables. For such models, Markov chain Monte Carlo methods can be implemented, but they are not without problems, in terms of both convergence and computational time. In some practical applications, the extent of these problems is such that Markov chain Monte Carlo sampling is simply not an appropriate tool for routine analysis. We show that, by using an integrated nested Laplace approximation and its simplified version, we can directly compute very accurate approximations to the posterior marginals. The main benefit of these approximations is computational: where Markov chain Monte Carlo algorithms need hours or days to run, our approximations provide more precise estimates in seconds or minutes. Another advantage with our approach is its generality, which makes it possible to perform Bayesian analysis in an automatic, streamlined way, and to compute model comparison criteria and various predictive measures so that models can be compared and the model under study can be challenged.     

Approximation of power in multivariate analysis

We consider the calculation of power functions in classical multivariate analysis. In this context, power can be expressed in terms of tail probabilities of certain noncentral distributions. The necessary noncentral distribution theory was developed between the 1940s and 1970s by a number of authors. However, tractable methods for calculating the relevant probabilities have been lacking. In this paper we present simple yet extremely accurate saddlepoint approximations to power functions associated with the following classical test statistics: the likelihood ratio statistic for testing the general linear hypothesis in MANOVA; the likelihood ratio statistic for testing block independence; and Bartlett's modified likelihood ratio statistic for testing equality of covariance matrices.     

A generating algorithm for linear trend-free and nearly linear trend-free block designs

The theory and properties of trend-free (TF) and nearly trend-free (NTF) block designs are wel1 developed. Applications have been hampered because a methodology for design construction has not been available.

This article begins with a short review of concepts and properties of TF and NTF block designs. The major contribution is provision of an algorithm for the construction of linear and nearly linear TF block designs. The algorithm is incorporated in a computer program in FORTRAN 77 provided in an appendix for the IBM PC or compatible microcomputer, a program adaptable also to other computers. Three sets of block designs generated by the program are given as examples.

A numerical example of analysis of a linear trend-free balanced incomplete block design is provided.     

A study of several useful tests for ordered alternatives in the randomized block design

This study investigates the small sample powers of several tests designed against ordered location alternatives in randomized block experiments. The results are intended to aid the researcher in the selection process. Toward this end the small sample powers of three classes of rank tests — tests based on ‘within-blocks’ rankings (W-tests), ‘among-b locks’ rankings (A-tests), and ‘ranking after alignment’ within blocks (RAA-tests)— are compared and contrasted with the asymptotic properties given by Pirie (1974) as well as with the empirical powers of competing parametric procedures.     

Graphical methods for comparing confounding in two or more designs

In many circumstances it is necessary to design an experiment with partial confounding of parameter estimates. In this situation, one would like to have tools to assess and compare candidate designs graphically. In this paper we discuss two graphical representations of design properties, and illustrate their application with two examples.     

On the analysis of multivariate repeated measures designs

The relationship between the mixed-model analysis and multivariate approach to a repeated measures design with multiple responses is presented. It is shown that by taking the trace of the appropriate submatrix of the hypothesis (error) sums of squares and crossproducts (SSCP) matrix obtained from the multivariate approach, one can get the hypothesis (error) SSCP matrix for the mixed-model analysis. Thus, when analyzing data from a multivariate repeated measures design, it is advantageous to use the multivariate approach because the result of the mixed-model analysis can also be obtained without additional computation.     

The relationship between two parameterizations of linear patterned mean and covariance models

Andrade and Helms (1984) study problems involving estimation and testing of linearly patterned mean and covariance matrices. They parameterize their models under the null hypothesis by using linear constraints on the alternative hypothesis parameterization. In this paper, we show that the nested models that Andrade and Helms consider can be transformed into the nested models considered by Anderson (1969, 1970, 1973) and Szatrowski (1979, 1980, 1981, 1983, 1985).     

PERFORMANCE OF THE LOCATION LINEAR DISCRIMINANT FUNCTION UNDER ACROSS-LOCATION HETEROSCEDASTICITY

ABSTRACT

Classification of data consisting of both categorical and continuous variables between two groups is often handled by the sample location linear discriminant function confined to each of the locations specified by the observed values of the categorical variables. Homoscedasticity of across-location conditional dispersion matrices of the continuous variables is often assumed. Quite often, interactions between continuous and categorical variables cause across-location heteroscedasticity. In this article, we examine the effect of heterogeneous across-location conditional dispersion matrices on the overall expected and actual error rates associated with the sample location linear discriminant function. Performance of the sample location linear discriminant function is evaluated against the results for the restrictive classifier adjusted for across-location heteroscedasticity. Conclusions based on a Monte Carlo study are reported.     

On Block Updating in Markov Random Field Models for Disease Mapping

Gaussian Markov random field (GMRF) models are commonly used to model spatial correlation in disease mapping applications. For Bayesian inference by MCMC, so far mainly single-site updating algorithms have been considered. However, convergence and mixing properties of such algorithms can be extremely poor due to strong dependencies of parameters in the posterior distribution. In this paper, we propose various block sampling algorithms in order to improve the MCMC performance. The methodology is rather general, allows for non-standard full conditionals, and can be applied in a modular fashion in a large number of different scenarios. For illustration we consider three different applications: two formulations for spatial modelling of a single disease (with and without additional unstructured parameters respectively), and one formulation for the joint analysis of two diseases. The results indicate that the largest benefits are obtained if parameters and the corresponding hyperparameter are updated jointly in one large block. Implementation of such block algorithms is relatively easy using methods for fast sampling of Gaussian Markov random fields ( Rue, 2001 ). By comparison, Monte Carlo estimates based on single-site updating can be rather misleading, even for very long runs. Our results may have wider relevance for efficient MCMC simulation in hierarchical models with Markov random field components.