A graph-aided method for planning two-level experiments when certain interactions are important
TL;DR: In this paper, a graph-aided method is proposed to solve the problem of fractional factorial factorial experiment planning, where prior knowledge may suggest that some interactions are potentially important and should therefore be estimated free of the main effects.
Abstract: In planning a fractional factorial experiment prior knowledge may suggest that some interactions are potentially important and should therefore be estimated free of the main effects. In this article, we propose a graph-aided method to solve this problem for two-level experiments. First, we choose the defining relations for a 2 n–k design according to a goodness criterion such as the minimum aberration criterion. Then we construct all of the nonisomorphic graphs that represent the solutions to the problem of simultaneous estimation of main effects and two-factor interactions for the given defining relations. In each graph a vertex represents a factor and an edge represents the interaction between the two factors. For the experiment planner, the job is simple: Draw a graph representing the specified interactions and compare it with the list of graphs obtained previously. Our approach is a substantial improvement over Taguchi's linear graphs.
Citations
More filters
TL;DR: For a fixed number of runs, when can designs have clear main effects or clear two-factor interactions (in brief, 2fi's) as mentioned in this paper, where s is any prime or prime power.
25 citations
TL;DR: In this paper, methods of constructing g-matrices are studied since such constructions are equivalent to the construction of g-designs, and some bounds on the absolute value of a determinant of a g -matrix are given.
25 citations
TL;DR: In this article, the concept of clear two-factor interactions is generalized to orthogonal arrays, leading to a much wider class of robust regular fractional factorial designs robust to nonnegligible 2F interactions.
Abstract: SUMMARY Regular fractional factorial designs with clear two-factor interactions provide a useful class of designs that are robust to nonnegligible two-factor interactions. In this paper, the concept of clear two-factor interactions is generalised to orthogonal arrays. The new concept leads to a much wider class of designs robust to nonnegligible two-factor interactions. We study the existence and construction of such designs. The designs we construct have a structure that render themselves particularly attractive in the robust parameter design setting. We also discuss an interesting connection between designs with clear two-factor interactions and mixed orthogonal arrays.
24 citations
Journal Article•
TL;DR: In this article, the theoretical properties of the foldover design and the resulting combined design obtained by augmenting an initial design by its foldover were investigated, and it was shown that there are two distinct ways to fold over a 2 kp design.
Abstract: In this article, we focus on the theoretical properties of the foldover design and the resulting combined design obtained by augmenting an initial design by its foldover. We prove that there are 2 p distinct ways to fold over a 2 kp design. Optimal foldover plans are also discussed. We investigate the impact of the inclusion of a blocking variable to the design. We show that the minimum aberration foldover design with the presence of the blocking effect is the same as the one without blocking.
24 citations
TL;DR: In this paper, the authors consider the problem of selecting appropriate 2m−p designs when some two-factor interactions are important and propose a minimum aberration criterion to minimize the contamination of these nonnegligible effects on the model.
Abstract: We consider the problem of selecting appropriate 2m−p designs when some two-factor interactions are important Current methods in the literature select designs that permit estimation of the postulated model consisting of the main effects and important two-factor interactions, under the assumption that all of the other effects are negligible When the effects not in the postulated model are not negligible, they will bias the estimates of the effects in the model To minimize the contamination of these nonnegligible effects on the model, we propose and study a minimum aberration criterion We then discuss the application of this new aberration criterion to compromise plans Finally, we examine how to search for the best designs according to the criterion and present some results for designs of 16 and 32 runs
23 citations
References
More filters
Book•
01 Jan 2015TL;DR: This book offers a complete blueprint for structuring projects to achieve rapid completion with high engineering productivity during the research and development phase to ensure that high quality products can be made quickly and at the lowest possible cost.
Abstract: From the Publisher:
Phadke was trained in robust design techniques by Genichi Taguchi, the mastermind behind Japanese quality manufacturing technologies and the father of Japanese quality control. Taguchi's approach is currently under consideration to be adopted as a student protocol with the US govrnment. The foreword is written by Taguchi. This book offers a complete blueprint for structuring projects to achieve rapid completion with high engineering productivity during the research and development phase to ensure that high quality products can be made quickly and at the lowest possible cost. Some topics covered are: orthogonol arrays, how to construct orthogonal arrays, computer-aided robutst design techniques, dynamic systems design methods, and more.
3,928 citations
"A graph-aided method for planning t..." refers methods in this paper
...For a review on efficient algorithms for testing graph isomorphism, see Read and Corneil (1977) and Hoffman (1982)....
[...]
...For simplicity we do not include in this article the column numbers for the lines, which can be easily read from the interaction tables given by Phadke (1989) and Taguchi (1987)....
[...]
TL;DR: The present state of the art of isomorphism testing is surveyed, its relationship to NP-completeness is discussed, and some of the difficulties inherent in this particularly elusive and challenging problem are indicated.
Abstract: The graph isomorphism problem—to devise a good algorithm for determining if two graphs are isomorphic—is of considerable practical importance, and is also of theoretical interest due to its relationship to the concept of NP-completeness. No efficient (i.e., polynomial-bound) algorithm for graph isomorphism is known, and it has been conjectured that no such algorithm can exist. Many papers on the subject have appeared, but progress has been slight; in fact, the intractable nature of the problem and the way that many graph theorists have been led to devote much time to it, recall those aspects of the four-color conjecture which prompted Harary to rechristen it the “four-color disease.” This paper surveys the present state of the art of isomorphism testing, discusses its relationship to NP-completeness, and indicates some of the difficulties inherent in this particularly elusive and challenging problem. A comprehensive bibliography of papers relating to the graph isomorphism problem is given.
519 citations
TL;DR: In this article, the concept of aberration is proposed as a way of selecting the best designs from those with maximum resolution, and algorithms are presented for constructing these minimum aberration designs.
Abstract: For studying k variables in N runs, all 2 k–p designs of maximum resolution are not equally good. In this paper the concept of aberration is proposed as a way of selecting the best designs from those with maximum resolution. Algorithms are presented for constructing these minimum aberration designs.
420 citations
01 Jan 1980
TL;DR: The concept of resolution was introduced by Box and Hunter as discussed by the authors, who defined the resolution of a two-level fractional factorial design as the length of the shortest word in the defining relation.
Abstract: Fractional factorial designs-especially the twolevel designs-are useful in a variety of experimental situations, for example, (i) screening studies in which only a subset of the variables is expected to be important, (ii) research investigations in which certain interactions are expected to be negligible and (iii) experimental programs in which groups of runs are to be performed sequentially, ambiguities being resolved as the investigation evolves (see Box, Hunter and Hunter, 1978). The literature on fractional factorial designs is extensive. For references before 1969, see the comprehensive bibliography of Herzberg and Cox (1969). For more recent references, see Daniel (1976) and Joiner (1975-79). A useful concept associated with 2k-P fractional factorial designs is that of resolution (Box and Hunter, 1961). A design is of resolution R if no cfactor effect is confounded with any other effect containing less than R c factors. For example, a design of resolution III does not confound main effects with one another but does confound main effects with two-factor interactions, and a design of resolution IV does not confound main effects with two-factor interactions but does confound two-factor interactions with one another. The resolution of a two-level fractional factorial design is the length of the shortest word in the defining relation. Usually an experimenter will prefer to use a design which has the highest
354 citations