Name
Abstract | ||
|---|---|---|
Two fractional factorial designs are called isomorphic if one can be obtained from the other by relabeling the factors, reordering the runs, and switching the levels of factors. To identify the isomorphism of two s -factor n -run designs is known to be an NP hard problem, when n and s increase. There is no tractable algorithm for the identification of isomorphic designs. In this paper, we propose a new algorithm based on the centered L 2 -discrepancy, a measure of uniformity, for detecting the isomorphism of fractional factorial designs. It is shown that the new algorithm is highly reliable and can significantly reduce the complexity of the computation. Theoretical justification for such an algorithm is also provided. The efficiency of the new algorithm is demonstrated by using several examples that have previously been discussed by many others. |
Year | DOI | Venue |
|---|---|---|
2001 | 10.1006/jcom.2000.0569 | J. Complexity |
Keywords | DocType | Volume |
uniformity,hamming distance,Hamming distance,isomorphism,fractional factorial design,factorial designs,uniformity. | Journal | 17 |
Issue | ISSN | Citations |
1 | Journal of Complexity | 5 |
PageRank | References | Authors |
1.03 | 2 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Chang-Xing Ma | 1 | 66 | 11.72 |
| Kai-Tai Fang | 2 | 165 | 23.65 |
| Dennis K. J. Lin | 3 | 234 | 27.21 |