Construction of Efficient Multi-Level k-Circulant Supersaturated Designs

This article proposes an algorithm to construct efficient balanced multi-level k-circulant supersaturated designs with m factors and n runs. The algorithm generates efficient balanced multi-level k-circulant supersaturated designs very fast. Using the proposed algorithm many balanced multi-level supersaturated designs are constructed and cataloged. A list of many optimal and near optimal, multi-level supersaturated designs is also provided for m ≤ 60 and number of levels (q) ≤10. The algorithm can be used to generate two-level k-circulant supersaturated designs also and some large optimal two-level supersaturated designs are presented. An upper bound to the number of factors in a balanced multi-level supersaturated design such that no two columns are fully aliased is also provided.     

Addition of runs to a two-level supersaturated design

The purpose of this article is to introduce a new class of extended E(s²)-optimal two level supersaturated designs obtained by adding runs to an existing E(s²)-optimal two level supersaturated design. The extended design is a union of two optimal SSDs belonging to different classes. New lower bound to E(s²) has been obtained for the extended supersaturated designs. Some examples and a small catalogue of E(s²)-optimal SSDs are also included.     

2<Superscript><Emphasis Type="Italic">m</Emphasis></Superscript>4<Superscript>1</Superscript> designs with minimum aberration or weak minimum aberration

For measuring the goodness of 2 ^m 4¹ designs, Wu and Zhang (1993) proposed the minimum aberration (MA) criterion. MA 2 ^m 4¹ designs have been constructed using the idea of complementary designs when the number of two-level factors, m, exceeds n/2, where n is the total number of runs. In this paper, the structures of MA 2 ^m 4¹ designs are obtained when m>5n/16. Based on these structures, some methods are developed for constructing MA 2 ^m 4¹ designs for 5n/16<m<n/2 as well as for n/2≤m<n. When m≤5n/16, there is no general method for constructing MA 2 ^m 4¹ designs. In this case, we obtain lower bounds for A ₃₀ and A ₃₁, where A ₃₀ and A ₃₁ are the numbers of type 0 and type 1 words with length three respectively. And a method for constructing weak minimum aberration (WMA) 2 ^m 4¹ designs (A ₃₀ and A ₃₁ achieving the lower bounds) is demonstrated. Some MA or WMA 2 ^m 4¹ designs with 32 or 64 runs are tabulated for practical use, which supplement the tables in Wu and Zhang (1993), Zhang and Shao (2001) and Mukerjee and Wu (2001).     

A Method for Analyzing Supersaturated Designs with a Block Orthogonal Structure

Supersaturated designs is a large class of factorial designs which can be used for screening out the important factors from a large set of potentially active variables. The huge advantage of these designs is that they reduce the experimental cost drastically, but their critical disadvantage is the confounding involved in the statistical analysis. In this article, we propose a method for analyzing data using a specific type of supersaturated designs. This method heavily uses the special block orthogonal structure of the supersaturated designs given by Tang and Wu (1997 Tang , B. , Wu , C. F. J. ( 1997 ). A method for constructing supersaturated designs and its Es ²-optimality . Canadian J. Statist. 25 : 191 – 201 .[Crossref], [Web of Science ®] , [Google Scholar]). Also, we compare our method with several known statistical analysis methods by using some of the existing supersaturated designs. The comparison is performed by some simulating experiments and the Type I and Type II error rates are calculated. The results are presented in tables and the discussion to follow.     

Optimal U-type design for Bayesian nonparametric multiresponse prediction

This paper presents an extension of the work of Yue and Chatterjee (2010) about U-type designs for Bayesian nonparametric response prediction. We consider nonparametric Bayesian regression model with p responses. We use U-type designs with n runs, m factors and q levels for the nonparametric multiresponse prediction based on the asymptotic Bayesian criterion. A lower bound for the proposed criterion is established, and some optimal and nearly optimal designs for the illustrative models are given.     

2 m 4 n designs with resolution III or IV containing clear two-factor interaction components

The orthogonal arrays with mixed levels have become widely used in fractional factorial designs. It is highly desirable to know when such designs with resolution III or IV have clear two-factor interaction components (2fic’s). In this paper, we give a complete classification of the existence of clear 2fic’s in regular 2 ^m 4 ⁿ designs with resolution III or IV. The necessary and sufficient conditions for a 2 ^m 4 ⁿ design to have clear 2fic’s are given. Also, 2 ^m 4 ⁿ designs of 32 runs with the most clear 2fic’s are given for n = 1,2.      

Some results on constructing two-level block designs with general minimum lower order confounding

Block designs are widely used in experimental situations where the experimental units are heterogeneous. The blocked general minimum lower order confounding (B-GMC) criterion is suitable for selecting optimal block designs when the experimenters have some prior information on the importance of ordering of the treatment factors. This paper constructs B-GMC 2^{n ? m}: 2^r designs with 5 × 2^l/16 + 1 ? n ? (N ? 2^l) < 2^{l ? 1} for l(r + 1 ? l ? n ? m ? 1), where 2^{n ? m}: 2^r denotes a two-level regular block design with N = 2^{n ? m} runs, n treatment factors, and 2^r blocks. With suitable choice of the blocking factors, each B-GMC block design has a common specific structure. Some examples illustrate the simple and effective construction method.     

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.     

Addition of runs to an s-level supersaturated design

The purpose of the present work is to extend the work of Gupta et al. (2010) to s  -level column balanced supersaturated designs. Addition of runs to an existing E(χ²)-optimal$E({\chi }^2)\mathrm{-}\mathrm{optimal}$ supersaturated design and to study the optimality of the resulting design is an important issue. This paper considers the study of the optimality of the resulting design. A lower bound to E(χ²)$E({\chi }^2)$ has been obtained for the extended supersaturated designs. Some examples and a small catalogue of E(χ²)-optimal$E({\chi }^2)\mathrm{-}\mathrm{optimal}$ supersaturated designs are also presented.     

Analyzing Supersaturated Designs by Means of an Information Based Criterion

The cost and time consumption of many industrial experimentations can be reduced using the class of supersaturated designs since this can be used for screening out the important factors from a large set of potentially active variables. A supersaturated design is a design for which there are fewer runs than effects to be estimated. Although there exists a wide study of construction methods for supersaturated designs, their analysis methods are yet in an early research stage. In this article, we propose a method for analyzing data using a correlation-based measure, named as symmetrical uncertainty. This method combines measures from the information theory field and is used as the main idea of variable selection algorithms developed in data mining. In this work, the symmetrical uncertainty is used from another viewpoint in order to determine more directly the important factors. The specific method enables us to use supersaturated designs for analyzing data of generalized linear models for a Bernoulli response. We evaluate our method by using some of the existing supersaturated designs, obtained according to methods proposed by Tang and Wu (1997 Tang , B. , Wu , C. F. J. (1997). A method for constructing supersaturated designs and its E(s ²)-optimality. Canadian Journal of Statistics 25:191–201.[Crossref], [Web of Science ®] , [Google Scholar]) as well as by Koukouvinos et al. (2008 Koukouvinos , C. , Mylona , K. , Simos , D. E. ( 2008 ). E(s ²)-optimal and minimax-optimal cyclic supersaturated designs via multi-objective simulated annealing . Journal of Statistical Planning and Inference 138 : 1639 – 1646 .[Crossref], [Web of Science ®] , [Google Scholar]). The comparison is performed by some simulating experiments and the Type I and Type II error rates are calculated. Additionally, Receiver Operating Characteristics (ROC) curves methodology is applied as an additional statistical tool for performance evaluation.     

Supersaturated designs with high searching probability

A supersaturated design is essentially a fractional factorial design whose number of experimental variables is greater than or equal to its number of experimental runs. Under the effect sparsity assumption, a supersaturated design can be very cost-effective. In this paper, our prime objective is to compare the existing two-level supersaturated designs for the noisy case through the probability of correct searching—a powerful criterion proposed by Shirakura et al. [1996. Searching probabilities for nonzeroeffects in search designs for the noisy case. Ann. Statist. 24, 2560–2568]. An algorithm is proposed to construct supersaturated designs with high probability of correct searching. Examples are given for illustration.     

Saturated main-effect designs for factorial experiments

The results of a computer search for saturated designs for 2ⁿ factorial experiments with n runs is reported, (where n = 2 mod 4). A complete search of the design space is avoided by focussing on designs constructed from cyclic generators. A method of searching quickly for the best generators is given. The resulting designs are as good as, and sometimes better than, designs obtained via search algorithms reported in the literature. The addition of a further factor having three levels is also considered. Here, too, a complete search is avoided by restricting attention to the most efficient part of the design space under p-efficiency.     

Weakly resolvable IV.3 search designs for the pn factorial experiment

A series of weakly resolvable search designs for the pⁿ factorial experiment is given for which the mean and all main effects are estimable in the presence of any number of two-factor interactions and for which any combination of three or fewer pairs of factors that interact may be detected. The designs have N = p(p–1)n+p runs except in one case where additional runs are required for detection and one case where $\text{(p?1)}\text{2}$ additional runs are needed to estimate all (p–1)² degrees of freedom for each pair of detected interactions. The detection procedure is simple enough that computations can be carried out with hand calculations.     

Model-robust supersaturated and partially supersaturated designs

Supersaturated designs are an increasingly popular tool for screening factors in the presence of effect sparsity. The advantage of this class of designs over resolution III factorial designs or Plackett–Burman designs is that n, the number of runs, can be substantially smaller than the number of factors, m. A limitation associated with most supersaturated designs produced thus far is that the capability of these designs for estimating g active effects has not been discussed. In addition to exploring this capability, we develop a new class of model-robust supersaturated designs that, for a given n and m, maximizes the number g   of active effects that can be estimated simultaneously. The capabilities of model-robust supersaturated designs for model discrimination are assessed using a model-discrimination criterion, the subspace angle. Finally, we introduce the class of partially supersaturated designs, intended for use when we require a specific subset of _m1$m_1$ core factors to be estimable, and the sparsity of effects principle applies to the remaining (m-_m1$m-m_1$) factors.     

Supersaturated designs of projectivity P=3 or near P=3

Supersaturated designs offer a potentially useful way to investigate many factors in few experiments i.e. typical screening situations. Their design properties have mainly been evaluated based on their ability to identify and estimate main effects. Projective properties have received little attention. In this paper we show how to construct two-level supersaturated designs for 2(n−2) factors in n runs (n a multiple of four) of projectivity P=3 or near projectivity P=3 from orthogonal non-regular two-level designs. The designs obtained also have favourable properties such as low maximum absolute value of the inner product between a main effect column and a two-factor interaction column and relatively few types of different projections onto subsets consisting of three factor columns.     

Construction of regular 2n41 designs with general minimum lower-order confounding

Mixed-level designs, especially two- and four-level designs, are very useful in practice. In the last two decades, there are quite a few literatures investigating the selection of this kind of optimal designs. Recently, the general minimum lower-order confounding (GMC) criterion (Zhang et al., 2008 Zhang, R.C., Li, P.F., Zhao, S.L., Ai, M.Y. (2008). A general minimum lower order confounding criterion for two-level regular design. Stat. Sin. 18:1689–1705.[Web of Science ®] , [Google Scholar]) gave a new approach for choosing optimal factorials. It is proved that the GMC designs are more powerful than other criteria in the widely practical situations. In this paper, we extend the GMC theory to the mixed-level designs. Under the theory we establish a new criterion for choosing optimal regular two- and four-level designs. Further, a construction method is proposed to obtain all the 2ⁿ4¹ GMC designs with N/4 + 1 ? n + 2 ? 5N/16, where N is the number of runs and n is the number of two-level factors.     

Bayesian D-optimal supersaturated designs

We introduce a new class of supersaturated designs using Bayesian D-optimality. The designs generated using this approach can have arbitrary sample sizes, can have any number of blocks of any size, and can incorporate categorical factors with more than two levels. In side by side diagnostic comparisons based on the E(s²)$E(s^2)$ criterion for two-level experiments having even sample size, our designs either match or out-perform the best designs published to date. The generality of the method is illustrated with quality improvement experiment with 15 runs and 20 factors in 3 blocks.     

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.     

Supersaturated design including an orthogonal base

Recently, many supersaturated designs have been proposed. A supersaturated design is a fractional factorial design in which the number of factors is greater than the number of experimental runs. The main thrust of the previous studies has been to generate more columns while avoiding large values of squared inner products among all design columns. These designs would be appropriate if the probability for each factor being active is uniformly distributed. When factors can be partitioned into two groups, namely, with high and low probabilities of each factor being active, it is desirable to maintain orthogonality among columns to be assigned to the factors in the high-probability group. We discuss a supersaturated design including an orthogonal base which is suitable for this common situation. Mathematical results on the existence of the supersaturated designs are shown, and the construction of supersaturated designs is presented. We next discuss some properties of the proposed supersaturated designs based on the squared inner products.     

Optimal selection and ordering of columns in supersaturated designs

Two methods to select columns for assigning factors to work on supersaturated designs are proposed. The focus of interest is the degree of non-orthogonality between the selected columns. One method is the exhaustive enumeration of selections of p columns from all k columns to find the exact optimality, while the other is intended to find an approximate solution by applying techniques used in the corresponding analysis, aiming for ease of use as well as a reduction in the large computing time required for large k with the first method. Numerical illustrations for several typical design matrices reveal that the resulting “approximately” optimal assignments of factors to their columns are exactly optimal for any p. Ordering the columns in E(s²)-optimal designs results in promising new findings including a large number of E(s²)-optimal designs.