Random sampling with a reservoir
From MaRDI portal
Publication:3675518
DOI10.1145/3147.3165zbMath0562.68028WikidataQ56521943 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/
optimization; probabilistic algorithms; analysis of algorithms; statistical software; rejection method; Pascal-like implementation
62-04: Software, source code, etc. for problems pertaining to statistics
68Q25: Analysis of algorithms and problem complexity
65C10: Random number generation in numerical analysis
65C99: Probabilistic methods, stochastic differential equations
Related Items
Unnamed Item, 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, Streaming Algorithms for Selection and Approximate Sorting, Approaches for scaling DBSCAN algorithm to large spatial databases, A distributed algorithm for finding Hamiltonian cycles in random graphs in \(O(\log n)\) time, Perfect $L_p$ Sampling in a Data Stream, Training a Neural-Network-Based Surrogate Model for Aerodynamic Optimisation Using a Gaussian Process, 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, 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, FPT Approximation for Constrained Metric k-Median/Means, Space-efficient estimation of statistics over sub-sampled streams, Approximate consistency for transformations on words and trees, Optimal sampling from sliding windows, Streaming techniques and data aggregation in networks of tiny artefacts, Competitive analysis of maintaining frequent items of a stream, Weighted sampling without replacement from data streams, Tracking join and self-join sizes in limited storage, 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, Sampling streaming data with replacement, Weighted random sampling with a reservoir, Finding the longest common sub-pattern in sequences of temporal intervals, Sampling in space restricted settings, 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, Submodular maximization over data streams with differential privacy noise, Web database sampling approach based on attribute correlation, Optimal Random Sampling from Distributed Streams Revisited, A Family of Unsupervised Sampling Algorithms, Sampling Technique for Complex Data, Parallel Streaming Random Sampling, Computer generated simple random samples
