Approximately optimal subset selection for statistical design and modelling
From MaRDI portal
Cites work
- A linear integer programming bound for maximum-entropy sampling
- An Exact Algorithm for Maximum Entropy Sampling
- Computer Construction of "D-Optimal" First-Order Designs
- Continuous relaxations for Constrained Maximum-Entropy Sampling
- Determinantal point processes for machine learning
- Determinantal processes and independence
- Distributions on partitions, point processes, and the hypergeometric kernel
- Efficient solution of maximum-entropy sampling problems
- Encyclopedia of environmetrics. In 4 vol
- Eynard-Mehta theorem, Schur process, and their Pfaffian analogs
- Handbook of environmental and ecological statistics
- Handbook of semidefinite programming. Theory, algorithms, and applications
- scientific article; zbMATH DE number 806801 (Why is no real title available?)
- Optimal monitoring network designs
- Optimum experimental designs, with SAS
- Statistical analysis of environmental space-time processes.
- The coincidence approach to stochastic point processes
- Using continuous nonlinear relaxations to solve constrained maximum-entropy sampling problems
Cited in
(4)- Asymptotic consistency for subset selection procedures satisfying the \(P^ *\)-condition
- scientific article; zbMATH DE number 3940420 (Why is no real title available?)
- Efficient computation of statistical procedures based on all subsets of a specified size
- A general theory of asymptotic consistency for subset selection with applications
This page was built for publication: Approximately optimal subset selection for statistical design and modelling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3389636)
