Random sampling with a reservoir
From MaRDI portal
Publication:3675518
DOI10.1145/3147.3165zbMath0562.68028OpenAlexW2119885577WikidataQ56521943 ScholiaQ56521943MaRDI QIDQ3675518
Publication date: 1985
Published in: ACM Transactions on Mathematical Software (Search for Journal in Brave)
Full work available at URL: http://www.acm.org/pubs/contents/journals/toms/1985-11/
optimizationprobabilistic algorithmsanalysis of algorithmsstatistical softwarerejection methodPascal-like implementation
Software, source code, etc. for problems pertaining to statistics (62-04) Analysis of algorithms and problem complexity (68Q25) Random number generation in numerical analysis (65C10) Probabilistic methods, stochastic differential equations (65C99)
Related Items
Approximate consistency for transformations on words and trees ⋮ Training a Neural-Network-Based Surrogate Model for Aerodynamic Optimisation Using a Gaussian Process ⋮ Online regularized learning with pairwise loss functions ⋮ Separating adaptive streaming from oblivious streaming using the bounded storage model ⋮ Sequential stratified regeneration: \textit{MCMC} for large state spaces with an application to subgraph count estimation ⋮ Streaming submodular maximization under differential privacy noise ⋮ Fast Search and Estimation of Bayesian Nonparametric Mixture Models Using a Classification Annealing EM Algorithm ⋮ AMID: approximation of multi-measured data using SVD ⋮ A stratified reservoir sampling algorithm in streams and large datasets ⋮ Efficient sampling methods for discrete distributions ⋮ Computer generated simple random samples ⋮ Evolving spiking neural networks for online learning over drifting data streams ⋮ Hybrid statistical estimation of mutual information and its application to information flow ⋮ 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 ⋮ Submodular maximization over data streams with differential privacy noise ⋮ Testing membership for timed automata ⋮ Remarks on some misconceptions about unequal probability sampling without replacement ⋮ Revisiting maximum satisfiability and related problems in data streams ⋮ Optimal sampling from sliding windows ⋮ On pricing approximate queries ⋮ A new binary (17,4,5) constant weight code ⋮ Revisiting maximum satisfiability and related problems in data streams ⋮ Forty years of frequent items ⋮ Finding the longest common sub-pattern in sequences of temporal intervals ⋮ FURL: fixed-memory and uncertainty reducing local triangle counting for multigraph streams ⋮ Streaming techniques and data aggregation in networks of tiny artefacts ⋮ Competitive analysis of maintaining frequent items of a stream ⋮ A Family of Unsupervised Sampling Algorithms ⋮ Sampling Technique for Complex Data ⋮ Parallel Streaming Random Sampling ⋮ Weighted sampling without replacement from data streams ⋮ Sampling in space restricted settings ⋮ Web database sampling approach based on attribute correlation ⋮ FPT Approximation for Constrained Metric k-Median/Means ⋮ Markov chain Monte Carlo sampling using a reservoir method ⋮ Tracking join and self-join sizes in limited storage ⋮ A survey on concept drift adaptation ⋮ Approaches for scaling DBSCAN algorithm to large spatial databases ⋮ Evolutionary Network Analysis ⋮ The worst page-replacement policy ⋮ Applying approximate counting for computing the frequency moments of long data streams ⋮ Unnamed Item ⋮ Sampling for passive internet measurement: a review ⋮ A profile-based tool for finding pipeline parallelism in sequential programs ⋮ A distributed algorithm for finding Hamiltonian cycles in random graphs in \(O(\log n)\) time ⋮ Random sampling and reconstruction of concentrated signals in a reproducing kernel space ⋮ Detecting concept change in dynamic data streams ⋮ Streaming Algorithms for Selection and Approximate Sorting ⋮ 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 ⋮ Sampling streaming data with replacement ⋮ Optimal Random Sampling from Distributed Streams Revisited ⋮ A general result for selecting balanced unequal probability samples from a stream ⋮ Effective approximation of parametrized closure systems over transactional data streams ⋮ Weighted random sampling with a reservoir ⋮ Online Mental Fatigue Monitoring via Indirect Brain Dynamics Evaluation ⋮ Perfect $L_p$ Sampling in a Data Stream ⋮ An estimator for matching size in low arboricity graphs with two applications ⋮ Space-efficient estimation of statistics over sub-sampled streams
