Subset selection from large datasets for kriging modeling
From MaRDI portal
Recommendations
- Properties and comparison of some kriging sub-model aggregation methods
- Efficiency improvement of kriging surrogate model by subset simulation in implicit expression problems
- Nested kriging predictions for datasets with a large number of observations
- Kriging: methods and applications
- Four algorithms to construct a sparse kriging kernel for dimensionality reduction
Cites work
- scientific article; zbMATH DE number 4085440 (Why is no real title available?)
- scientific article; zbMATH DE number 1209388 (Why is no real title available?)
- scientific article; zbMATH DE number 1084399 (Why is no real title available?)
- scientific article; zbMATH DE number 1497419 (Why is no real title available?)
- scientific article; zbMATH DE number 775913 (Why is no real title available?)
- scientific article; zbMATH DE number 795587 (Why is no real title available?)
- scientific article; zbMATH DE number 849075 (Why is no real title available?)
- scientific article; zbMATH DE number 961607 (Why is no real title available?)
- A Comparison of Three Methods for Selecting Values of Input Variables in the Analysis of Output from a Computer Code
- A taxonomy of global optimization methods based on response surfaces
- An efficient algorithm for constructing optimal design of computer experiments
- Analytical models for locating undesirable facilities
- Computational aspects of the maximum diversity problem
- Design and analysis of computer experiments. With comments and a rejoinder by the authors
- Efficient global optimization of expensive black-box functions
- Heuristic and Special Case Algorithms for Dispersion Problems
- Lagrangian solution of maximum dispersion problems
- Large Sample Properties of Simulations Using Latin Hypercube Sampling
- Maximin Latin Hypercube Designs in Two Dimensions
- Metamodels for computer-based engineering design: Survey and recommendations
- Orthogonal Array-Based Latin Hypercubes
- Orthogonal arrays. Theory and applications
- The discrete p-dispersion problem
- Upper bounds and exact algorithms for \(p\)-dispersion problems
Cited in
(4)- Sequential Design of Experiment for Sparse Polynomial Chaos Expansions
- Properties and comparison of some kriging sub-model aggregation methods
- Efficiency improvement of kriging surrogate model by subset simulation in implicit expression problems
- Nested kriging predictions for datasets with a large number of observations
This page was built for publication: Subset selection from large datasets for kriging modeling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q381304)
