Differential evolutionary algorithm in the construction process of optimal experimental designs

This article shows how a differential evolution algorithm can be used to find statistical designs under several optimality criteria as A, D, and T. The general algorithm of differential evolution is described and then applied on constructing optimal designs for several well-known models and compare them with those already available by other algorithms, in terms of relative efficiency. Moreover, the great effect of population size in the running of this algorithm establishes a precedent in the use of differential evolution algorithms over genetic algorithms.     

A new look on optimal foldover plans in terms of uniformity criteria

In this paper, we develop a new mechanism for finding the optimal foldover plans (OFPs) which is based on the uniformity criteria measured by Lee discrepancy, wrap-around L₂-discrepancy, and centered L₂-discrepancy. For three-level fractional factorials as the original designs, general foldover plans and combined designs are defined, and lower bounds of these three discrepancies of combined designs under general foldover plans are also obtained, which can be used as benchmarks for searching OFPs. Illustrative examples with a comparison study between the foldover plans under these discrepancies are provided. Our results provide a theoretical justification for OFPs of three-level designs in terms of uniformity criteria.     

Generation of space-filling uniform designs in unit hypercubes

In this paper a new discrepancy measure of uniformity for uniform designs (UDs) in a unit cube is presented. Alternative measures of uniformity based on distance criteria which can be applied to higher dimensions are also discussed. The good lattice point (glp) method was used to construct the uniform designs. Two approaches (generator equivalence and projection) of reducing the computational cost of the glp method are proposed and discussed. Two examples are presented in this paper.     

A comparison of uniformity tests

Problems of goodness-of-fit to a given distribution can usually be reduced to test uniformity. The uniform distribution appears due to natural random events or due to the application of methods for transforming samples from any other distribution to the samples with values uniformly distributed in the interval (0, 1). Thus, one can solve the problem of testing if a sample comes from a given distribution by testing whether its transformed sample is distributed according to the uniform distribution. For this reason, the methods of testing for goodness-of-fit to a uniform distribution have been widely investigated. In this paper, a comparative power analysis of a selected set of statistics is performed in order to give suggestions on which one to use for testing uniformity against the families of alternatives proposed by Stephens [Stephens, M.A., 1974, EDF statistics for goodness of fit and some comparisons. Journal of the American Statistical Association, 69, 730–737.]. Definition and some relevant features of the considered test statistics are given in section 1. Implemented numerical processes to calculate percentage points of every considered statistic are described in section 2. Finally, a Monte Carlo simulation experiment has been carried out to fulfill the mentioned target of this paper.     

Optimum mixture designs in some constrained experimental regions

In a mixture experiment, the response depends on the mixing proportions of the components present in the mixture. Optimum designs are available for the estimation of parameters of the models proposed in such situations. However, these designs are found to include the vertex points of the simplex Ξ defining the experimental region, which are not mixtures in the true sense. Recently, Mandal et al. (2015 Mandal, N.K., Pal, M., Sinha, B.K., and Das, P. (2015). Optimum mixture designs in a restricted region. Stat. Pap. 56(1):105–119.[Crossref], [Web of Science ®] , [Google Scholar]) derived optimum designs when the experiment is confined to an ellipsoidal region within Ξ, which does not include the vertices of Ξ. In this paper, an attempt has been made to find optimum designs when the experimental region is a simplex or is cuboidal inside Ξ and does not contain the extreme points.     

A class of new pbib designs

Two series of PBIB designs, one with three associate classes and theother with four associate classes ars developed. Efficiency factors for two designs are computed.     

Lower bounds of various criteria in experimental designs

Criterion is essential for measuring the goodness of an experimental design. In this paper, lower bounds of various criteria in experimental designs will be reviewed according to methodology of their construction. The criteria include most well-known ones which are frequently used as benchmarks for orthogonal array, uniform design, supersaturated design and other types of designs. To derive the lower bounds of these criteria, five different approaches are explored. Some new results are given. Throughout the paper, some relationships among different types of lower bounds are also discussed.     

Recursive formulae for the average efficiency factor in block and row-column designs

Interchange algorithms are widely used to construct efficient block and row-column designs. We provide simple recursive formulae for updating this average efficiency factor, so that it is no longer computationally expensive to calculate it after each possible interchange.     

On optimality properties of simple block designs in the approximate design theory

Optimality properties of approximate block designs are studied under variations of (1) the class of competing designs, (2) the optimality criterion, (3) the parametric function of interest, and (4) the statistical model. The designs which are optimal turn out to be the product of their treatment and block marginals, and uniform designs when the support is specified in advance. Optimality here means uniform, universal, and simultaneous j_p-optimality. The classical balanced incomplete block designs are embedded into this approach, and shown to be simultaneously j_p-optimal for a maximal system of identifiable parameters. A geometric account of universal optimality is given which applies beyond the context of block designs.     

Entropy-based tests of uniformity: A Monte Carlo power comparison

In this article, we consider different entropy estimators and propose some entropy-based tests of uniformity. Critical values of the proposed test statistics are obtained by Monte Carlo simulation. Then the power values of the tests for various alternatives and sample sizes are compared. Finally, some recommendations for the application of the proposed tests in practice are presented.     

Universal optimality of experimental designs: Definitions and a criterion

Several definitions of universal optimality of experimental designs are found in the Literature; we discuss the interrelations of these definitions using a recent characterization due to Friedland of convex functions of matrices. An easily checked criterion is given for a design to satisfy the main definition of universal optimality; this criterion says that a certain set of linear functions of the eigenvalues of the information matrix is maximized by the information matrix of a design if and only if that design is universally optimal. Examples are given; in particular we show that any universally optimal design is (M, S)-optimal in the sense of K. Shah.     

Generalized discrete discrepancy and its applications in experimental designs

In recent years, there has been increasing interest in the study of discrete discrepancy. In this paper, the popular discrete discrepancy is extended to the so-called generalized discrete discrepancy. Connections among generalized discrete discrepancy and other optimality criteria, such as orthogonality, generalized minimum aberration and minimum moment aberration, are investigated. These connections provide strong statistical justification of generalized discrete discrepancy. A lower bound of generalized discrete discrepancy is also obtained, which serves as an important benchmark of design uniformity.     

Lower bound of average centered L2-discrepancy for U-type designs

Uniform designs are widely used in various scientific investigations and industrial applications. By considering all possible level permutation of the factors, a connection between average centered L₂-discrepancy and generalized wordlength pattern for asymmetrical fractional factorial designs is derived. Moreover, we present new lower bounds to the average centered L₂-discrepancy for symmetrical and asymmetrical U-type designs. For illustration of the theoretical results, the lower bounds for symmetrical and asymmetrical U-type designs are tabulated, and numerical results indicate that our lower bounds behave well and can be recommended for use in practice.     

A comparison of random balance and two-stage group screening designs: A case study

In this paper we focus on the problem of supersaturated (fewer runs than factors) screening experiments. We consider two major types of designs which have been proposed in this situ¬ation: random balance and two-stage group screening. We discuss the relative merits and demerits of each strategy. In addition, we compare the performance of these strategies by means of a case study in which 100 factors are screened in 20,42,62, and 84 runs.     

A review of optimal designs in survey sampling

Results in five areas of survey sampling dealing with the choice of the sampling design are reviewed. In Section 2, the results and discussions surrounding the purposive selection methods suggested by linear regression superpopulation models are reviewed. In Section 3, similar models to those in the previous section are considered; however, random sampling designs are considered and attention is focused on the optimal choice of π_j. Then in Section 4, systematic sampling methods obtained under autocorrelated superpopulation models are reviewed. The next section examines minimax sampling designs. The work in the final section is based solely on the randomization. In Section 6 methods of sample selection which yield inclusion probabilities π_j = n/N and π_ij = n(n - 1)/N(N - 1), but for which there are fewer than _NC_n possible samples, are mentioned briefly.     

A fast algorithm for constructing efficient event-related functional magnetic resonance imaging designs

We propose a novel, efficient approach for obtaining high-quality experimental designs for event-related functional magnetic resonance imaging (ER-fMRI), a popular brain mapping technique. Our proposed approach combines a greedy hill-climbing algorithm and a cyclic permutation method. When searching for optimal ER-fMRI designs, the proposed approach focuses only on a promising restricted class of designs with equal frequency of occurrence across stimulus types. The computational time is significantly reduced. We demonstrate that our proposed approach is very efficient compared with a recently proposed genetic algorithm approach. We also apply our approach in obtaining designs that are robust against misspecification of error correlations.     

A study of uniformity pattern for extended designs

The objective of this paper is to investigate the issue of projection discrepancy for extended U-type or nearly U-type extended designs along the line of Fang and Qin (2005 Fang, K. T., and H. Qin. 2005. Uniformity pattern and related criteria for two-level factorials. Science China Series A 48:1–11.[Crossref] , [Google Scholar]) based on the centered L₂-discrepancy proposed in Hickernell (1998 Hickernell, F. J. 1998. A generalized discrepancy and quadrature error bound. Mathematics of Computation 67:299–322.[Crossref], [Web of Science ®] , [Google Scholar]). Extended designs are obtained through augmenting optimally few runs (or points) to an optimal U-type design. Lower bounds to projection discrepancy with reference to the centered L₂-discrepancy of extended designs have been obtained. Some illustrative examples are also provided.     

Efficient maximin distance designs for experiments in mixtures

In this paper, different dissimilarity measures are investigated to construct maximin designs for compositional data. Specifically, the effect of different dissimilarity measures on the maximin design criterion for two case studies is presented. Design evaluation criteria are proposed to distinguish between the maximin designs generated. An optimization algorithm is also presented. Divergence is found to be the best dissimilarity measure to use in combination with the maximin design criterion for creating space-filling designs for mixture variables.     

A study of BIB designs through support matrices

This paper deals with the existence and nonexistence of BIB designs with repeated blocks. The approach is an algebraic one. The concept of a support matrix is introduced and some of its basic properties are noted. Some basic examples of support matrices are given when the block size is 3. The connection between full column rank proper support matrices and irreducible designs is explored and some examples of such matrices are given.     

Circular balanced repeated measurement designs in periods of three different sizes

Abstract

Repeated measurement designs are widely used in medicine, pharmacology, animal sciences and psychology. If there is a restriction on the total number of treatments, some experimental units can receive on the total length of time while some experimental units can remain in the trial, then repeated measurements designs with unequal period sizes should be used. In this article, some infinite series are developed to generate the minimal balanced repeated measurement designs in periods of three different sizes p₁, p₂ and p₃, where 2?≤?p₃?<?p₂ ≤ 10 and p₂?<?p₁.