发表状态 | 已发表Published |
题名 | On the construction of multi-level supersaturated designs |
作者 | |
发表日期 | 2000 |
发表期刊 | Journal of Statistical Planning and Inference
![]() |
ISSN/eISSN | 0378-3758 |
卷号 | 86期号:1页码:239-252 |
摘要 | New criteria of comparing multi-level supersaturated designs are proposed and their properties are studied. A new class of multi-level supersaturated designs are obtained by collapsing a U-type uniform design to an orthogonal array. A global optimization algorithm, the threshold accepting algorithm, is then applied to search for the best supersaturated designs under any prespecified criterion. Examples show that these newly constructed supersaturated designs have good modeling properties. © 2000 Elsevier Science B.V. |
关键词 | Collapsing method Effect sparsity Near orthogonal design Orthogonal array Supersaturated designs Threshold accepting U-type designs Uniform designs |
DOI | 10.1016/s0378-3758(99)00163-9 |
URL | 查看来源 |
收录类别 | SCIE |
语种 | 英语English |
WOS研究方向 | Mathematics |
WOS类目 | Statistics & Probability |
WOS记录号 | WOS:000085999800016 |
Scopus入藏号 | 2-s2.0-0001669481 |
引用统计 | |
文献类型 | 期刊论文 |
条目标识符 | https://repository.uic.edu.cn/handle/39GCC9TT/2485 |
专题 | 个人在本单位外知识产出 |
通讯作者 | Fang, Kaitai |
作者单位 | 1.Department of Mathematics, Hong Kong Baptist Univ./Chinese A., Beijing, China 2.Department of Management Science, Penn State University, University Park, PA 16803, United States 3.Department of Statistics, Nankai University, China |
推荐引用方式 GB/T 7714 | Fang, Kaitai,Lin, Dennis K.J.,Ma, Changxing. On the construction of multi-level supersaturated designs[J]. Journal of Statistical Planning and Inference, 2000, 86(1): 239-252. |
APA | Fang, Kaitai, Lin, Dennis K.J., & Ma, Changxing. (2000). On the construction of multi-level supersaturated designs. Journal of Statistical Planning and Inference, 86(1), 239-252. |
MLA | Fang, Kaitai,et al."On the construction of multi-level supersaturated designs". Journal of Statistical Planning and Inference 86.1(2000): 239-252. |
条目包含的文件 | 条目无相关文件。 |
除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。
修改评论