Adaptive grid designs for classifying monotonic binary deterministic computer simulations
From MaRDI portal
Cites work
- A Comparison of Three Methods for Selecting Values of Input Variables in the Analysis of Output from a Computer Code
- A generalized Gaussian process model for computer experiments with binary time series
- A supermartingale approach to Gaussian process based sequential design of experiments
- Accelerated Monte Carlo estimation of exceedance probabilities under monotonicity constraints
- Active Sampling: A Machine-Learning-Assisted Framework for Finite Population Inference with Optimal Subsamples
- Approximation of limit state surfaces in monotonic Monte Carlo settings, with applications to classification
- Computational Aspects of Three-Term Recurrence Relations
- Efficient global optimization of expensive black-box functions
- Finite-Dimensional Gaussian Approximation with Linear Inequality Constraints
- Gaussian process emulators for computer experiments with inequality constraints
- scientific article; zbMATH DE number 3746271 (Why is no real title available?)
- scientific article; zbMATH DE number 1950483 (Why is no real title available?)
- Nonlinear Experiments: Optimal Design and Inference Based on Likelihood
- Nonparametric kernel regression subject to monotonicity constraints
- Optimal designs for two-level factorial experiments with binary response
- Strictly monotone and smooth nonparametric regression for two or more variables
- Support vector machine active learning with applications to text classification
- Support-vector networks
- The design and analysis of computer experiments.
This page was built for publication: Adaptive grid designs for classifying monotonic binary deterministic computer simulations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7313070)
