Bayesian optimal blocking of factorial designs

The presence of block effects makes the optimal selection of fractional factorial designs a difficult task. The existing frequentist methods try to combine treatment and block wordlength patterns and apply minimum aberration criterion to find the optimal design. However, ambiguities exist in combining the two wordlength patterns and therefore, the optimality of such designs can be challenged. Here we propose a Bayesian approach to overcome this problem. The main technique is to postulate a model and a prior distribution to satisfy the common assumptions in blocking and then, to develop an optimal design criterion for the efficient estimation of treatment effects. We apply our method to develop regular, nonregular, and mixed-level blocked designs. Several examples are presented to illustrate the advantages of the proposed method.     

Optimal blocking and foldover plans for nonregular two-level designs

This paper discusses the issue of choosing optimal designs when both blocking and foldover techniques are simultaneously employed to nonregular two-level fractional factorial designs. By using the indicator function, the treatment and block generalized wordlength patterns of the combined blocked design under a general foldover plan are defined. Some general properties of combined block designs are also obtained. Our results extend the findings of Ai et al. (2010) from regular designs to nonregular designs. Based on these theoretical results, a catalog of optimal blocking and foldover plans in terms of the generalized aberration criterion for nonregular initial design with 12, 16 and 20 runs is tabulated, respectively.     

An effective construction method for multi-level uniform designs

Uniform designs are widely used in various applications. However, it is computationally intractable to construct uniform designs, even for moderate number of runs, factors and levels. We establish a linear relationship between average squared centered L₂-discrepancy and generalized wordlength pattern, and then based on it, we propose a general method for constructing uniform designs with arbitrary number of levels. The main idea is to choose a generalized minimum aberration design and then permute its levels. We propose a novel stochastic algorithm and obtain many new uniform designs that have smaller centered L₂-discrepancies than the existing ones.     

Construction of minimum aberration blocked two-level regular factorial designs

ABSTRACT

In this article, we consider the construction of minimum aberration 2^{n ? k}: 2^p designs with respect to some existing combined wordlength patterns, where a 2^{n ? k}: 2^p design is a blocked two-level design with n treatment factors, 2^p blocks, and N = 2^q runs with q = n ? k. Two methods are proposed for two situations: n ? 2^{q ? p} ? 1 and n > N/2. These methods enable us to obtain some new minimum aberration 2^{n ? k}: 2^p designs from existing minimum aberration unblocked and blocked designs. Examples are included to illustrate the theory.     

Minimum aberration blocking schemes for 128-run designs

Several criteria have been proposed for ranking blocked fractional factorial designs. For large fractional factorial designs, the most appropriate minimum aberration criterion was one proposed by Cheng and Wu (2002). We justify this assertion and propose a novel construction method to overcome the computational challenge encountered in large fractional factorial designs. Tables of minimum aberration blocked designs are presented for N=128 runs and n=8–64 factors.     

Algebraic statistics of level codings for fractional factorial designs

We discuss the applications of algebraic statistics to fractional factorial design with special emphasis on the choice of level coding. In particular, we deal with the theory of Bayley's level codings in that framework.     

Creating catalogues of two-level nonregular fractional factorial designs based on the criteria of generalized aberration

We consider the problem of constructing good two-level nonregular fractional factorial designs. The criteria of minimum G and G₂ aberration are used to rank designs. A general design structure is utilized to provide a solution to this practical, yet challenging, problem. With the help of this design structure, we develop an efficient algorithm for obtaining a collection of good designs based on the aforementioned two criteria. Finally, we present some results for designs of 32 and 40 runs obtained from applying this algorithmic approach.     

D‐optimal minimax fractional factorial designs

The D‐optimal minimax criterion is proposed to construct fractional factorial designs. The resulting designs are very efficient, and robust against misspecification of the effects in the linear model. The criterion was first proposed by Wilmut & Zhou (2011); their work is limited to two‐level factorial designs, however. In this paper we extend this criterion to designs with factors having any levels (including mixed levels) and explore several important properties of this criterion. Theoretical results are obtained for construction of fractional factorial designs in general. This minimax criterion is not only scale invariant, but also invariant under level permutations. Moreover, it can be applied to any run size. This is an advantage over some other existing criteria. The Canadian Journal of Statistics 41: 325–340; 2013 © 2013 Statistical Society of Canada     

Experimentation order in factorial designs: new findings

Under some very reasonable hypotheses, it becomes evident that randomizing the run order of a factorial experiment does not always neutralize the effect of undesirable factors. Yet, these factors do have an influence on the response, depending on the order in which the experiments are conducted. On the other hand, changing the factor levels is many times costly; therefore it is not reasonable to leave to chance the number of changes necessary. For this reason, run orders that offer the minimum number of factor level changes and at the same time minimize the possible influence of undesirable factors on the experimentation have been sought. Sequences which are known to produce the desired properties in designs with 8 and 16 experiments can be found in the literature. In this paper, we provide the best possible sequences for designs with 32 experiments, as well as sequences that offer excellent properties for designs with 64 and 128 experiments. The method used to find them is based on a mixture of algorithmic searches and an augmentation of smaller designs.     

Isomorphism check in fractional factorial designs via letter interaction pattern matrix

Two fractional factorial designs are considered isomorphic if one can be obtained from the other by relabeling the factors, reordering the runs, and/or switching the levels of factors. To identify the isomorphism of two designs is known as an NP hard problem. In this paper, we propose a three-dimensional matrix named the letter interaction pattern matrix (LIPM) to characterize the information contained in the defining contrast subgroup of a regular two-level design. We first show that an LIPM could uniquely determine a design under isomorphism and then propose a set of principles to rearrange an LIPM to a standard form. In this way, we can significantly reduce the computational complexity in isomorphism check, which could only take O(2^p)+O(3k³)+O(2^k) operations to check two 2^k−p designs in the worst case. We also find a sufficient condition for two designs being isomorphic to each other, which is very simple and easy to use. In the end, we list some designs with the maximum numbers of clear or strongly clear two-factor interactions which were not found before.     

Experimentation order in factorial designs with 8 or 16 runs

Randomizing the order of experimentation in a factorial design does not always achieve the desired effect of neutralizing the influence of unknown factors. In fact, with some very reasonable assumptions, an important proportion of random orders afford the same degree of protection as that obtained by experimenting in the design matrix standard order. In addition, randomization can induce a big number of changes in factor levels and thus make experimentation expensive and difficult. This paper discusses this subject and suggests experimentation orders for designs with 8 or 16 runs that combine an excellent level of protection against the influence of unknown factors, with the minimum number of changes in factor levels.     

Experimentation order with good properties for 2 k factorial designs

Randomizing the order of experimentation in a factorial design does not always achieve the desired effect of neutralizing the influence of unknown factors. In fact, with some very reasonable assumptions, an important proportion of random orders achieve the same degree of protection as that obtained by experimenting in the design matrix standard order. In addition, randomization can induce a large number of changes in factor levels and thus make experimentation expensive and difficult. De Leon et al. [Experimentation order in factorial designs with 8 or 16 runs, J. Appl. Stat. 32 (2005), pp. 297–313] proposed experimentation orders for designs with eight or 16 runs that combine an excellent level of protection against the influence of unknown factors, with the minimum number of changes in factor levels. This article presents a new methodology to obtain experimentation orders with the desired properties for designs with any number of runs.     

Multivariate Bayesian U-type asymmetric designs for non parametric response surface prediction under correlated errors

The objective of this paper is to study U-type designs for Bayesian non parametric response surface prediction under correlated errors. The asymptotic Bayes criterion is developed in terms of the asymptotic approach of Mitchell et al. (1994 Mitchell, T., Sacks, J., Ylvisaker, D. (1994). Asymptotic Bayes criteria for nonparametric response surface design. Ann. Stat. 22:634–651.[Crossref], [Web of Science ®] , [Google Scholar]) for a more general covariance kernel proposed by Chatterjee and Qin (2011 Chatterjee, K., Qin, H. (2011). Generalized discrete discrepancy and its applications in experimental designs. J. Stat. Plann. Inference 141:951–960.[Crossref], [Web of Science ®] , [Google Scholar]). A relationship between the asymptotic Bayes criterion and other criteria, such as orthogonality and aberration, is then developed. A lower bound for the criterion is also obtained, and numerical results show that this lower bound is tight. The established results generalize those of Yue et al. (2011 Yue, R.X., Qin, H., Chatterjee, K. (2011). Optimal U-type design for Bayesian nonparametric multiresponse prediction. J. Stat. Plann. Inference 141:2472–2479.[Crossref], [Web of Science ®] , [Google Scholar]) from symmetrical case to asymmetrical U-type designs.     

Catalogue of small runs nonregular designs from hadamard matrices with generalized minimum aberration

Fries and Hunter ( 1980 ) proposed the Minimum Aberration criterion (MA) for selecting regular designs. The regular designs with MA are msot commonly used because they are considered as the best designs. How ever, as pointed out by Chen, Sun and Wu ( 1993 ), there are situations that other designs may better meet the design need. Therefore, they catalogued some two-level and three-level fractional factorial regular designs with small (16,27,32,64) runs. For nonregular designs, such as the ones taken from Hadamard matrices, the MA criterion is not appUcable. Deng and Tang ( 1999 ) introduced Generalized Minimum Aberration Criterion (GMA) as a natural extension to the MA criterion. Similar to the case in the regular designs, other designs may better meet practical need, In this paper, we use the GMA criterion to give a catalogue of nonregular designs with smaU (16,20,24) runs.     

On the problem of augmented fractional factorial designs

Let D be a saturated fractional factorial design of the general K₁ x K₂ ...x K_t factorial such that it consists of m distinct treatment combinations and it is capable of providing an unbiased estimator of a subvector of m factorial parameters under the assumption that the remaining k-m,t (k = H it ) factorial parameters are negligible. Such a design will not provide an unbiased estimator of the varianceσ² Suppose that D is an optimal design with respect to some optimality criterion (e.g. d-optimality, a-optimality or e-optimality) and it is desirable to augment D with c treatmentcombinations with the aim to estimate ² Suppose that D is an optimal design with respect to some optimality criterion (e.g. d-optimality, a-optimality or e-optimality) and it is desirable to augment D with c treatment combinations with the aim to estimate σ² unbiasedly. The problem then is how to select the c treatment combinations such that the augmented design D retains its optimality property. This problem, in all its generality is extremely complex. The objective of this paper is to provide some insight in the problem by providing a partial answer in the case of the 2^tfactorial, using the d-optimality criterion.     

A note on the selection of optimal foldover plans for 16- and 32-run fractional factorial designs

The minimum aberration criterion has been advocated for ranking foldovers of 2^k−p$2^{k-p}$ fractional factorial designs (Li and Lin, 2003); however, a minimum aberration design may not maximize the number of clear low-order effects. We propose using foldover plans that sequentially maximize the number of clear low-order effects in the combined (initial plus foldover) design and investigate the extent to which these foldover plans differ from those that are optimal under the minimum aberration criterion. A small catalog is provided to summarize the results.     

One-eighth- and one-sixteenth-fraction quaternary code designs with high resolution

The development of a general methodology for the construction of good two-level nonregular designs has received significant attention over the last 10 years. Recent works by Phoa and Xu (2009) and Zhang et al. (2011) indicate that quaternary code (QC) designs are very promising in this regard. This paper explores a systematic construction for 1/8th and 1/16th fraction QC designs with high resolution for any number of factors. The 1/8th fraction QC designs often have larger resolution than regular designs of the same size. A majority of the 1/16th fraction QC designs also have larger resolution than comparable two-level regular designs.     

Bounds on the maximum number of clear two‐factor interactions for 2m‐p designs of resolution III and IV

The authors derive upper and lower bounds on the maximum number of clear two‐factor interactions in 2^m?p fractional factorial designs of resolution III and IV. A two‐factor interaction is said to be clear if it is not aliased with any main effect or with any other two‐factor interaction. The lower bounds are obtained by exhibiting specific designs. By comparing the bounds with the values of the maximum number of clear two‐factor interactions in cases where it is known, one concludes that the construction methods perform quite well.     

Results for two-level fractional factorial designs of resolution IV or more

The main theorem of this paper shows that foldover designs are the only (regular or nonregular) two-level factorial designs of resolution IV (strength 3) or more for n   runs and n/3?m?n/2$n/3?m?n/2$ factors. This theorem is a generalization of a coding theory result of Davydov and Tombak [1990. Quasiperfect linear binary codes with distance 4 and complete caps in projective geometry. Problems Inform. Transmission 25, 265–275] which, under translation, effectively states that foldover (or even) designs are the only regular two-level factorial designs of resolution IV or more for n   runs and 5n/16?m?n/2$5n/16?m?n/2$ factors. This paper also contains other theorems including an alternative proof of Davydov and Tombak's result.