Package: MOFAT 1.0
MOFAT: Maximum One-Factor-at-a-Time Designs
Identifying important factors from a large number of potentially important factors of a highly nonlinear and computationally expensive black box model is a difficult problem. Xiao, Joseph, and Ray (2022) <doi:10.1080/00401706.2022.2141897> proposed Maximum One-Factor-at-a-Time (MOFAT) designs for doing this. A MOFAT design can be viewed as an improvement to the random one-factor-at-a-time (OFAT) design proposed by Morris (1991) <doi:10.1080/00401706.1991.10484804>. The improvement is achieved by exploiting the connection between Morris screening designs and Monte Carlo-based Sobol' designs, and optimizing the design using a space-filling criterion. This work is supported by a U.S. National Science Foundation (NSF) grant CMMI-1921646 <https://www.nsf.gov/awardsearch/showAward?AWD_ID=1921646>.
Authors:
MOFAT_1.0.tar.gz
MOFAT_1.0.zip(r-4.7)MOFAT_1.0.zip(r-4.6)MOFAT_1.0.zip(r-4.5)
MOFAT_1.0.tgz(r-4.6-any)MOFAT_1.0.tgz(r-4.5-any)
MOFAT_1.0.tar.gz(r-4.7-any)MOFAT_1.0.tar.gz(r-4.6-any)
MOFAT_1.0.tgz(r-4.6-emscripten)
manual.pdf |manual.html✨
card.svg |card.png
MOFAT/json (API)
| # Install 'MOFAT' in R: |
| install.packages('MOFAT', repos = c('https://vroshanjoseph.r-universe.dev', 'https://cloud.r-project.org')) |
This package does not link to any Github/Gitlab/R-forge repository. No issue tracker or development information is available.
Last updated from:c608e1edcc. Checks:9 OK. Indexed: yes.
| Target | Result | Time | Files | Syslog |
|---|---|---|---|---|
| linux-devel-x86_64 | OK | 102 | ||
| source / vignettes | OK | 129 | ||
| linux-release-x86_64 | OK | 120 | ||
| macos-release-arm64 | OK | 140 | ||
| macos-oldrel-arm64 | OK | 129 | ||
| windows-devel | OK | 61 | ||
| windows-release | OK | 71 | ||
| windows-oldrel | OK | 57 | ||
| wasm-release | OK | 87 |
Dependencies:SLHD
Readme and manuals
Help Manual
| Help page | Topics |
|---|---|
| Screening measures | measure |
| MOFAT | mofat |
