Subset selection from large datasets for kriging modeling
From MaRDI portal
Publication:381304
DOI10.1007/s00158-008-0306-8zbMath1274.62496OpenAlexW3125105377MaRDI QIDQ381304
Publication date: 15 November 2013
Published in: Structural and Multidisciplinary Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00158-008-0306-8
robustnessradial basis functionsuniformitydispersion problemsubset selectionspace fillingdesign of computer experimentskriging modellarge non-uniform datasets
Related Items
Efficiency improvement of kriging surrogate model by subset simulation in implicit expression problems, Sequential Design of Experiment for Sparse Polynomial Chaos Expansions
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The discrete p-dispersion problem
- Analytical models for locating undesirable facilities
- Efficient global optimization of expensive black-box functions
- Orthogonal arrays. Theory and applications
- Computational aspects of the maximum diversity problem
- Design and analysis of computer experiments. With comments and a rejoinder by the authors
- A taxonomy of global optimization methods based on response surfaces
- An efficient algorithm for constructing optimal design of computer experiments
- Upper bounds and exact algorithms for \(p\)-dispersion problems
- A Comparison of Three Methods for Selecting Values of Input Variables in the Analysis of Output from a Computer Code
- Maximin Latin Hypercube Designs in Two Dimensions
- Large Sample Properties of Simulations Using Latin Hypercube Sampling
- Orthogonal Array-Based Latin Hypercubes
- Heuristic and Special Case Algorithms for Dispersion Problems
- Lagrangian solution of maximum dispersion problems
- Metamodels for computer-based engineering design: Survey and recommendations
