A review on design inspired subsampling for big data
From MaRDI portal
Publication:6549149
Recommendations
Cites work
- scientific article; zbMATH DE number 3954145 (Why is no real title available?)
- scientific article; zbMATH DE number 45785 (Why is no real title available?)
- scientific article; zbMATH DE number 1220667 (Why is no real title available?)
- scientific article; zbMATH DE number 1313654 (Why is no real title available?)
- scientific article; zbMATH DE number 510850 (Why is no real title available?)
- scientific article; zbMATH DE number 735224 (Why is no real title available?)
- scientific article; zbMATH DE number 1471721 (Why is no real title available?)
- scientific article; zbMATH DE number 6125590 (Why is no real title available?)
- A general theory for orthogonal array based Latin hypercube sampling
- A note on generalized aberration in factorial designs
- A statistical perspective on algorithmic leveraging
- Admissibility and minimaxity of the uniform design measure in nonparametric regression model
- An Optimal Transport Approach for Selecting a Representative Subsample with Application in Efficient Kernel Density Estimation
- Are more data always better for factor analysis?
- Asymptotic Theory of Rejective Sampling with Varying Probabilities from a Finite Population
- Auction algorithms for network flow problems: A tutorial introduction
- Bagging predictors
- Blendenpik: Supercharging LAPACK's Least-Squares Solver
- Deterministic Sampling of Expensive Posteriors Using Minimum Energy Designs
- Distributed subdata selection for big data via sampling-based approach
- Efficient computation of smoothing splines via adaptive basis sampling
- Empirical likelihood confidence intervals for complex sampling designs
- Energy statistics: a class of statistics based on distances
- Experiments. Planning, analysis and optimization.
- Extensible Grids: Uniform Sampling on a Space Filling Curve
- FM-criterion for representative points
- Fast Monte Carlo Algorithms for Matrices I: Approximating Matrix Multiplication
- Feature Screening for Massive Data Analysis by Subsampling
- General equivalence theory for optimum designs (approximate theory)
- Information-Based Optimal Subdata Selection for Big Data Linear Regression
- Information-based optimal subdata selection for big data logistic regression
- LSRN: A parallel iterative solver for strongly over- or underdetermined systems
- Large-Scale Datastreams Surveillance via Pattern-Oriented-Sampling
- Local case-control sampling: efficient subsampling in imbalanced data sets
- Local polynomial regresssion estimators in survey sampling.
- Local uncertainty sampling for large-scale multiclass logistic regression
- LowCon: A Design-based Subsampling Approach in a Misspecified Linear Model
- Model Selection and Multimodel Inference
- Model-robust subdata selection for big data
- Monge-Kantorovich depth, quantiles, ranks and signs
- Monte Carlo and quasi-Monte Carlo sampling
- More efficient approximation of smoothing splines via space-filling basis selection
- More efficient estimation for logistic regression with optimal subsamples
- Most likely optimal subsampled Markov chain Monte Carlo
- Note on Grouping
- On Design Orthogonality, Maximin Distance, and Projection Uniformity for Computer Experiments
- On computationally tractable selection of experiments in measurement-constrained regression models
- On greedy heuristics for computing D-efficient saturated subsets
- On the connection between maximin distance designs and orthogonal designs
- On the sequential construction of optimum bounded designs
- Optimal Design of Experiments
- Optimal Distributed Subsampling for Maximum Quasi-Likelihood Estimators With Massive Data
- Optimal Sampling for Generalized Linear Models Under Measurement Constraints
- Optimal subsampling algorithms for big data regressions
- Optimal subsampling for large sample logistic regression
- Optimal subsampling for large-scale quantile regression
- Optimal subsampling for large‐sample quantile regression with massive data
- Optimal subsampling for linear quantile regression models
- Optimal subsampling for quantile regression in big data
- Optimal subsampling for softmax regression
- Optimum experimental designs, with SAS
- Orthogonal Column Latin Hypercubes and Their Application in Computer Experiments
- Orthogonal arrays. Theory and applications
- Penalized likelihood regression: General formulation and efficient approximation
- Principal points
- Representative points for location-biased datasets
- Reverse iterative volume sampling for linear regression
- Revisiting the Nyström method for improved large-scale machine learning
- Sampling-based estimation for massive survival data with additive hazards model
- Smoothing Splines Approximation Using Hilbert Curve Basis Selection
- Smoothing spline ANOVA models
- Some properties of incomplete U-statistics
- Some results on the convergence of conditional distributions
- Speeding Up MCMC by Efficient Data Subsampling
- Subdata selection algorithm for linear model discrimination
- Subdata selection based on orthogonal array for big data
- Subsampling and Jackknifing: A Practically Convenient Solution for Large Data Analysis With Limited Computational Resources
- Support points
- The Role of Sampling Weights When Modeling Survey Data
- The design and analysis of computer experiments.
- Uniform designs limit aliasing
- Variable Selection for Gaussian Process Models using Experimental Design-Based Subagging
- Weighting for Unequal Selection Probabilities in Multilevel Models
Cited in
(3)
This page was built for publication: A review on design inspired subsampling for big data
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6549149)