Abstract
The aliased effect-number pattern, proposed by Zhang et al. (Stat Sin 18:1689–1705, 2008), is often used to express the overall confounding between factorial effects in two-level regular designs. The confounding relationships of main effects and two-factor interactions have been well revealed in literature, but little is known about three and higher-order interactions. To fill the gaps, this paper aims to study the confounding of three-order interactions in any two-level design. When the factor number of the design is larger, we derive the confounding among lower-order and three-order interactions via the complementary method. Further, confounding formulas can be obtained owing to the consulting sets of the structured designs. These two approaches can cover all designs in the sense of isomorphism. As an application of the previous results, the confounding numbers of three-order interactions are tabulated for 16, 32, and 64-run optimal designs under the general minimum lower-order confounding criterion.
Similar content being viewed by others
References
Chen J, Liu MQ (2011) Some theory for constructing general minimum lower-order confounding designs. Stat Sin 21:1541–55
Chen J, Wu CFJ (1991) Some results on \(s^{n-k}\) fractional factorial designs with minimum aberration of optimal moments. Ann Stat 2:1028–1041
Chen J, Sun DX, Wu CFJ (1993) A catalogue of two-level and three-level fractional factorial designs with small runs. Intern Stat Rev 61:131–145
Cheng CS, Tang B (2005) A general theory of minimum aberration and its applications. Ann Stat 33:944–958
Cheng Y, Zhang RC (2010) On construction of general minimum lower order confounding \(2^{n-m}\) designs with \(N/4+1\le n \le 9N/32\). J Stat Plan Inference 140:2384–2394
Franklin MF (1984) Constructing tables of minimum aberration \(p^{n-m}\) designs. Technometrics 26:225–232
Fries A, Hunter WG (1980) Minimum aberration \(2^{k-p}\) designs. Technometrics 22:601–608
Guo B, Zhou Q, Zhang RC (2014) Some results on constructing general minimum lower order confounding \(2^{n-m}\) designs for \(n \le 2^{n-m-2}\). Metrika 77:721–32
Jessica J, Ding XT, Xu HQ, Wong WK, Ho CM (2013) Application of fractional factorial designs to study drug combinations. Stat Med 32(2):307–318
Li PF, Zhao SL, Zhang RC (2011) A theory on constructing \(2^{n-m}\) designs with general minimum lower order confounding. Stat Sin 21:1571–89
Li ZM, Zhao SL, Zhang RC (2015) On general minimum lower order confounding for \(s\)-level regular designs. Stat Probab Lett 99:202–209
Li ZM, Teng ZD, Zhang TF, Zhang RC (2016) Analysis on \(s^{n-m}\) designs with general minimum lower-order confounding. AStA Adv Stat Anal 100:207–222
Mukerjee R, Wu CFJ (2006) A modern theory of factorial designs. Springer, New York
Suen CY, Chen H, Wu CFJ (1997) Some identities on \(q^{n-m}\) designs with application to minimum aberration designs. Ann Stat 25:1176–1188
Xu H, Cheng CS (2008) A complementary desgin theory for doubling. Ann Stat 36:445–457
Zhang RC, Cheng Y (2010) General minimum lower order confounding designs: an overview and a construction theory. J Stat Plan Inference 140:1719–1730
Zhang RC, Mukerjee R (2009) Characterization of general minimum lower order confounding via complementary sets. Stat Sin 19:363–375
Zhang RC, Li P, Zhao SL, Ai MY (2008) A general minimum lower-order confounding criterion for two-level regular designs. Stat Sin 18:1689–1705
Acknowledgements
Chongya Yan and Zhiming Li’s work is partially supported by the National Natural Science Foundation of China Grant 12061070 and the Science and Technology Department of Xinjiang Uygur Autonomous Region Grant 2021D01E13. Mingyao Ai’s work is partially supported by NSFC Grants 12071014 and 12131001, and LMEQF.
Author information
Authors and Affiliations
Corresponding authors
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Appendix: Proofs of Lemmas 1–4
Appendix: Proofs of Lemmas 1–4
Proof of Lemma 1
Let \(A_1=\{(d_1,d_2,d_3): d_1\in \overline{D}, d_2,d_3\in D, d_1d_2d_3=\gamma \}\) and \(A_2=\{(d_1,d_2,d_3): d_1\in D, d_2,d_3\in \overline{D}, d_1d_2d_3=\gamma \}\). By the definition of \(B_3(D,\gamma )\), for any \(\gamma \in H_q\), we have
From Proposition 1, there are \((N-2)(N-4)/2\) factors \(d_i\) satisfying \(d_{i_1}d_{i_2}d_{i_3}=\gamma \) without considering the repetition. It implies that for any fix factor in \(H_q\backslash \gamma \), say \(d_1\), equation \(\#\{d_1: d_1d_2d_3=\gamma , d_1,d_2,d_3\in H_q\backslash \gamma \}=2\). Hence, we have
Through the above equation, it leads to
Next, we calculate the value of \(\#A_2\). For any factor \(\gamma \in D\), it follows that
Similar to the above derivation, it can be obtained that \(\#A_2=(N-n-2)(N-n-3)/2-3B_3(\overline{D}, \gamma )-B_2(\overline{D}, \gamma )\) for \(\gamma \in \overline{D}\). Substituting \(\#A_2\) into Eq. (7), the proof is complete. \(\square \)
Proof of Lemma 2
Let \(A_1=\{(d_1,d_2,d_3): d_1\in [H_q\backslash H_r], d_2,d_3\in D\backslash [H_q\backslash H_r], d_1d_2d_3=\gamma \}\) and \(A_2=\{(d_1,d_2,d_3): d_1\in D\backslash [H_q\backslash H_r], d_2,d_3\in [H_q\backslash H_r], d_1d_2d_3=\gamma \}\). For any \(\gamma \in H_q\), it follows that
For any \(\gamma \in H_r, \#A_1=0\). Then
Let \(A_2'=\{(d_1,d_2,d_3): d_1\in H_r, d_2,d_3\in [H_q\backslash H_r], d_1d_2d_3=\gamma \}\). For \(d_1, \gamma \in H_r\), there must exist \(d_2, d_3\in [H_q\backslash H_r]\) such that \(d_1d_2d_3=\gamma \). Hence, we have \(\#A_2'=(2^r-2)(N-2^r)/2\) for \(\gamma \in H_r\). It implies that for any fix factor in the remaining \(2^r-2\) factors in \(H_r\), say \(d_1\), equation \(\#\{d_1: d_1d_2d_3=\gamma , d_1,d_2,d_3,\gamma \in H_r\}=(N-2^r)/2\). Then,
For \(\gamma \in [H_q\backslash H_r]\), \(B_3(D\backslash [H_q\backslash H_r], \gamma )=0\). Thus
Similar to the derivation of Lemma 1, it can be obtained that \(\#A_1=(n-N+2^r)(n-N+2^r-1)/2\) and \(\#A_2=(N-2^{r+1})(n-N+2^r)/2\). Therefore, the proof is complete. \(\square \)
Proof of Lemma 3
By the definition of \(B_3(D,\gamma )\) and \(\gamma \in [H_q\backslash H_{q-1}]\), we have
where \(A_1=\{(d_1,d_2,d_3): d_1\in [H_q\backslash H_{q-1}]\backslash D, d_2,d_3\in D, d_1d_2d_3=\gamma \}\) and \(A_2=\{(d_1,d_2,d_3): d_1\in D, d_2,d_3\in [H_q\backslash H_{q-1}]\backslash D, d_1d_2d_3=\gamma \}\). Obviously, \(\sum \limits _{i=1}^2i\#A_i+3B_3([H_q\backslash H_{q-1}]\backslash D,\gamma )\) is the total number of the factors in \([H_q\backslash H_{q-1}]\backslash D\), appearing in the sets: \(\{(d_1, d_2, d_3): d_i \in [H_q\backslash H_{q-1}], i=1,2,3, d_1d_2d_3=\gamma \}\). By Proposition 3, there are \((N-2)(N-4)/8\) factors satisfying \(d_1 d_2 d_3=\gamma \). Hence,
Thus, \(B_3([H_q\backslash H_{q-1}],\gamma )=B_3(D,\gamma )+\#A_1+\#A_2+B_3([H_q\backslash H_{q-1}]\backslash D,\gamma )\). Further, we have
Based on the equation above, it is vital to calculate the value of \(\#A_2\). Similarly to the proofs of Lemmas 1 and 2, we can obtain
The proof is completed by combining the above conclusions. \(\square \)
Proof of Lemma 4
By the definition of \(B_2(dH_r,\gamma )\) and \(\gamma \in H_r\), we have
where \(T_1=\{(d_1,d_2): d_1\in [H_q\backslash H_{q-1}]\backslash D, d_2\in \widetilde{D}, d_1d_2=\gamma \}\). Thus,
For any \(\gamma \in H_r\), we have
If \(\gamma \in d \{ [H_q\backslash H_{q-1}] \backslash D\}\), then \(\#T_1+2B_2([H_q\backslash H_{q-1}]\backslash D, \gamma )= N/2-n-1\) and
If \(\gamma \in H_r \backslash \{[H_q\backslash H_{q-1}]\backslash D\},\) then \(\#T_1+2B_2([H_q\backslash H_{q-1}]\backslash D, \gamma )= N/2-n\) and
Therefore,
Substituting Eq. (9) into Lemma 3, we complete the proof. \(\square \)
Rights and permissions
Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.
About this article
Cite this article
Yan, C., Li, Z. & Ai, M. Characterization of three-order confounding via consulting sets. Metrika 86, 753–779 (2023). https://doi.org/10.1007/s00184-023-00892-7
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00184-023-00892-7