Random sampling with a reservoir
From MaRDI portal
Recommendations
Cited in
(93)- Sampling streaming data with replacement
- Weighted random sampling with a reservoir
- An efficient parallel algorithm for random sampling
- Finding the longest common sub-pattern in sequences of temporal intervals
- Markov chain Monte Carlo sampling using a reservoir method
- Random sampling and reconstruction of concentrated signals in a reproducing kernel space
- An estimator for matching size in low arboricity graphs with two applications
- Separating adaptive streaming from oblivious streaming using the bounded storage model
- Streaming submodular maximization under differential privacy noise
- Evolving spiking neural networks for online learning over drifting data streams
- On pricing approximate queries
- FURL: fixed-memory and uncertainty reducing local triangle counting for multigraph streams
- The worst page-replacement policy
- Applying approximate counting for computing the frequency moments of long data streams
- A general result for selecting balanced unequal probability samples from a stream
- Online regularized learning with pairwise loss functions
- AMID: approximation of multi-measured data using SVD
- Efficient sampling methods for discrete distributions
- Hybrid statistical estimation of mutual information and its application to information flow
- Sampling for passive internet measurement: a review
- Detecting concept change in dynamic data streams
- Space-efficient estimation of statistics over sub-sampled streams
- Approximate consistency for transformations on words and trees
- Submodular maximization over data streams with differential privacy noise
- A stochastic simulation algorithm for accelerating RRA
- An improved deterministic algorithm for generating different many-element random samples
- Web database sampling approach based on attribute correlation
- Optimal Random Sampling from Distributed Streams Revisited
- An efficient algorithm for random sampling without replacement
- A family of unsupervised sampling algorithms
- Sampling Technique for Complex Data
- Parallel streaming random sampling
- Sequential random sampling
- Faster methods for random sampling
- Computer generated simple random samples
- Optimal sampling from sliding windows
- Reservoir-sampling algorithms of time complexity O ( n (1 + log( N / n )))
- Experience selection in deep reinforcement learning for control
- Efficient parallel random sampling-vectorized, cache-efficient, and online
- Streaming techniques and data aggregation in networks of tiny artefacts
- Competitive analysis of maintaining frequent items of a stream
- scientific article; zbMATH DE number 1857637 (Why is no real title available?)
- scientific article; zbMATH DE number 2101371 (Why is no real title available?)
- Weighted sampling without replacement from data streams
- Less is More: Sparse Graph Mining with Compact Matrix Decomposition
- Discovering and Exploiting Statistical Properties for Query Optimization in Relational Databases: A Survey
- Online training on a budget of support vector machines using twin prototypes
- On supervised mining of dynamic content‐based networks1
- Online mental fatigue monitoring via indirect brain dynamics evaluation
- Fast Search and Estimation of Bayesian Nonparametric Mixture Models Using a Classification Annealing EM Algorithm
- A stratified reservoir sampling algorithm in streams and large datasets
- A survey on concept drift adaptation
- Evolutionary network analysis: a survey
- Streaming Algorithms for Selection and Approximate Sorting
- Perfect \(L_p\) sampling in a data stream
- Training a Neural-Network-Based Surrogate Model for Aerodynamic Optimisation Using a Gaussian Process
- A distributed algorithm for finding Hamiltonian cycles in random graphs in O( n) time
- Approaches for scaling DBSCAN algorithm to large spatial databases
- One-pass additive-error subset selection for \(\ell_p\) subspace approximation and \((k, p)\)-clustering
- Subsampling spectral clustering for stochastic block models in large-scale networks
- FPT Approximation for Constrained Metric k-Median/Means
- Testing membership for timed automata
- Remarks on some misconceptions about unequal probability sampling without replacement
- Revisiting maximum satisfiability and related problems in data streams
- A new binary (17,4,5) constant weight code
- Forty years of frequent items
- Revisiting maximum satisfiability and related problems in data streams
- Fast random integer generation in an interval
- Recent advances in scaling-down sampling methods in machine learning
- A selective review on statistical methods for massive data computation: distributed computing, subsampling, and minibatch techniques
- Online randomized interpolative decomposition with \textit{a posteriori} error estimator for temporal PDE data reduction
- On sampling based algorithms for k-means
- Solving the Poisson equation using coupled Markov chains
- Empirical evaluation of normalizing flows in Markov chain Monte Carlo
- Fair maximization of monotone submodular functions in data streams
- Continual learning as computationally constrained reinforcement learning
- Online list labeling: breaking the ^2n barrier
- Tracking join and self-join sizes in limited storage
- Detecting interactions in high-dimensional data using cross leverage scores
- Descent-to-delete: gradient-based methods for machine unlearning
- Subsampling-based modified Bayesian information criterion for large-scale stochastic block models
- Towards optimal dynamic indexes for approximate (and exact) triangle counting
- 4-strand Burau is unfaithful modulo 5
- Data with logical and statistical constraints
- Near-optimal two-pass streaming algorithm for sampling random walks over directed graphs
- Streaming submodular maximization with fairness constraints for massive data summarization
- Near uniform triangle sampling over adjacency list graph streams
- SAMix: calibrated and accurate continual learning via sphere-adaptive mixup and neural collapse
- Constructing long paths in graph streams
- Adversarial laws of large numbers and optimal regret in online classification
- Effective approximation of parametrized closure systems over transactional data streams
- Sequential stratified regeneration: \textit{MCMC} for large state spaces with an application to subgraph count estimation
- A profile-based tool for finding pipeline parallelism in sequential programs
This page was built for publication: Random sampling with a reservoir
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3675518)
