The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
A Class of Three-Level Designs for Definitive Screening in the Presence of Second-Order Effects
Abstract
Screening designs are attractive for assessing the relative impact of a large number of factors on a response of interest. Experimenters often prefer quantitative factors with three levels over two-level factors because having three levels allows for some assessment of curvature in the factor—response relationship. Yet, the most familiar screening designs limit each factor to only two levels. We propose a new class of designs that have three levels, provide estimates of main effects that are unbiased by any second-order effect, require only one more than twice as many runs as there are factors, and avoid confounding of any pair of second-order effects. Moreover, for designs having six factors or more, our designs allow for the efficient estimation of the full quadratic model in any three factors. In this respect, our designs may render follow-up experiments unnecessary in many situations, thereby increasing the efficiency of the entire experimentation process. We also provide an algorithm for design construction.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Regression shrinkage and selection via the lasso
Tibshirani, R. (1996) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.2517-6161.1996.tb02080.x · Cited by 51,482
Cited by
Kauffman, K. J., Dorkin, J. R., Yang, J. H., Heartlein, M. W., DeRosa, F., Mir, F. F., Fenton, O. S., & Anderson, D. G. (2015) · Nano Letters · doi:10.1021/acs.nanolett.5b02497 · Cited by 796
Grangeia, H. B., Silva, C., Simões, S. P., & Reis, M. S. (2020) · European Journal of Pharmaceutics and Biopharmaceutics · doi:10.1016/j.ejpb.2019.12.007 · Cited by 257
Kaczmarek, J. C., Kauffman, K. J., Fenton, O. S., Sadtler, K., Patel, A. K., Heartlein, M. W., DeRosa, F., & Anderson, D. G. (2018) · Nano Letters · doi:10.1021/acs.nanolett.8b02917 · Cited by 218
Metadata
- Authors
- Jones, B., & Nachtsheim, C. J.
- Venue
- Journal of Quality Technology
- Publisher
- Informa UK Limited
- Published
- 2011-01
- Volume
- 43
- Issue
- 1
- Pages
- 1-15
- ISSN
- 0022-4065 (ISSN-L)
- 2575-6230
- OpenAlex
- W108082997
- Cited by
- 483
- References
- 1
- FWCI
- 14.31
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.