Minimax and Minimax Projection Designs Using Clustering
From MaRDI portal
Cites work
- Estimation of Principal Points
- Fast hierarchical clustering and other applications of dynamic closest pairs
- scientific article; zbMATH DE number 6381735 (Why is no real title available?)
- scientific article; zbMATH DE number 3850830 (Why is no real title available?)
- scientific article; zbMATH DE number 53679 (Why is no real title available?)
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- scientific article; zbMATH DE number 822320 (Why is no real title available?)
- scientific article; zbMATH DE number 5060482 (Why is no real title available?)
- scientific article; zbMATH DE number 3063454 (Why is no real title available?)
- k-Means Has Polynomial Smoothed Complexity
- Least squares quantization in PCM
- Lectures on modern convex optimization. Analysis, algorithms, and engineering applications
- Maximum projection designs for computer experiments
- Minimax distance designs in two-level factorial experiments
- Note on Grouping
- On Equitable Resource Allocation Problems: A Lexicographic Minimax Approach
- On the distribution of points in a cube and the approximate evaluation of integrals
- Optimal sensor networks scheduling in identification of distributed parameter systems
- Principal points
- Two-dimensional minimax Latin hypercube designs
Cited in
(25)- Support points
- Adaptive method for indirect identification of the statistical properties of random fields in a Bayesian framework
- A comparison of general-purpose optimization algorithms for finding optimal approximate experimental designs
- minimaxdesign
- An efficient surrogate model for emulation and physics extraction of large eddy simulations
- Space-filling experimental designs for constrained design spaces
- Plausible Screening Using Functional Properties for Simulations with Large Solution Spaces
- APIK: Active Physics-Informed Kriging Model with Partial Differential Equations
- Bayesian quadrature, energy minimization, and space-filling design
- \textsf{cmenet}: A new method for bi-level variable selection of conditional main effects
- Maximum expected entropy transformed Latin hypercube designs
- Two‐dimensional projection uniformity for space‐filling designs
- Stacking Designs: Designing Multifidelity Computer Experiments with Target Predictive Accuracy
- Conglomerate multi-fidelity Gaussian process modeling, with application to heavy-ion collisions
- A Hierarchical Expected Improvement Method for Bayesian Optimization
- Space-Filling Designs for Robustness Experiments
- d-QPSO: A Quantum-Behaved Particle Swarm Technique for FindingD-Optimal Designs With Discrete and Continuous Factors and a Binary Response
- Sequential Designs for Filling Output Spaces
- A Graphical Multi-Fidelity Gaussian Process Model, with Application to Emulation of Heavy-Ion Collisions
- Modification of the Maximin and ϕp (Phi) Criteria to Achieve Statistically Uniform Distribution of Sampling Points
- Efficient kriging using interleaved lattice-based designs with low fill and high separation distance properties
- Optimizing sensor calibration in open environments: a Bayesian approach for non-specific multisensory systems
- Construction of uniform designs for high-dimensional screening via an adjusted multiple quadrupling algorithm
- Additive Multi-Index Gaussian Process Modeling, with Application to Multi-Physics Surrogate Modeling of the Quark-Gluon Plasma
- Jeffreys' prior penalty for high-dimensional logistic regression: a conjecture about aggregate bias
This page was built for publication: Minimax and Minimax Projection Designs Using Clustering
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q123949)
