A graph-aided method for planning two-level experiments when certain interactions are important
Citations
Cites background or methods from "A graph-aided method for planning t..."
...A disadvantage of this method, as Wu and Chen (1992)pointed out, is that the total number of linear graphs is usually too large to be included in the collection....
[...]
...For example, the left of the following two graphs is a 16-run linear graph taken fromWu and Chen (1992)....
[...]
...The approach used byWu and Chen (1992) andSun and Wu (1994)is different....
[...]
...Collections of linear graphs can be found in the appendices of Taguchi (1987) andWu and Chen (1992)....
[...]
Cites background from "A graph-aided method for planning t..."
...…thus far for ranking regular and non-regular fractional factorial designs, for instance, maximum resolution criterion (Box and Hunter 1961), minimum aberration (Fries and Hunter 1980), maximum number of clear effects (Wu and Chen 1992) and generalized minimum aberration (Deng and Tang 1999)....
[...]
...Several design criteria have been proposed thus far for ranking regular and non-regular fractional factorial designs, for instance, maximum resolution criterion (Box and Hunter 1961), minimum aberration (Fries and Hunter 1980), maximum number of clear effects (Wu and Chen 1992) and generalized minimum aberration (Deng and Tang 1999)....
[...]
References
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)....
[...]
519 citations
420 citations
354 citations