Everything about Reservoir sampling
Randomized algorithm
Reservoir sampling is a family of randomized online algorithms for choosing a simple random sample, without replacement, of k items from a population of unknown size n in a single pass over the items. The size of the population n is not known to the algorithm and is typically too large for all n items to fit into main memory. The population is revealed to the algorithm over time, and the algorithm cannot look back at previous items. At any point, the current state of the algorithm must permit extraction of a simple random sample without replacement of size k over the part of the population seen so far. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: Reservoir samplingA 5-minute orientation
- Skim a recent paper: Interferometric Synthetic Aperture Radar (InSAR)-Based Absence Sampling for Machine-Learning-Based Landslide Susceptibility Mapping: The Three Gorges Reservoir Area, ChinaInfluential work since 2022
- Pick up a classic book: Annual report of the State Board of Health of Massachusetts. 1875The most-reprinted book on the subject
- Read the landmark paper: Random sampling with a reservoirCited 1,345 times
- Go sideways: Simple random sampleA closely related topic
- Go sideways: Huffman codingA closely related topic
📖 Definitions
No dictionary entry for this exact phrase.
🏆 Landmark papers (most cited)
Random sampling with a reservoir
Weighted random sampling with a reservoir
Reservoir optimization using sampling SDP with ensemble streamflow prediction (ESP) forecasts
Sampling stochastic dynamic programming applied to reservoir operation
Investigation of the sampling performance of ensemble-based methods with a simple reservoir model
Sampling to elucidate the dynamics of infections in reservoir hosts
Analysis of Material Loading to Cannonsville Reservoir: Advantages of Event-Based Sampling
Finite reservoir replica exchange to enhance canonical sampling in rugged energy surfaces
🆕 Influential since 2022
Interferometric Synthetic Aperture Radar (InSAR)-Based Absence Sampling for Machine-Learning-Based Landslide Susceptibility Mapping: The Three Gorges Reservoir Area, China
Quantum optical reservoir computing powered by boson sampling
First downhole sampling of a natural hydrogen reservoir in Colombia
Reservoir Sampling over Joins
Efficiently Counting Triangles for Hypergraph Streams by Reservoir-Based Sampling
📚 Books worth reading
Annual report of the State Board of Health of Massachusetts. 1875[name missing] · 1898
Annual report of the State Board of Health of Massachusetts. 1875[name missing] · 1906
Annual report of the State Board of Health of Massachusetts. 1875[name missing] · 1899
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- Simple random sample In statistics, a simple random sample (or SRS) is a subset of individuals (a sample) chosen from a larger set (a population) in which a subset of individuals…
- Huffman coding In computer science and information theory, a Huffman code is a particular type of optimal prefix code that is commonly used for lossless data compression…
- Samplesort Samplesort is a sorting algorithm that is a divide and conquer algorithm often used in parallel processing systems. Conventional divide and conquer sorting…
- Count-distinct problem In computer science, the count-distinct problem (also known in applied mathematics as the cardinality estimation problem) is the problem of finding the…
- MinHash In computer science and data mining, MinHash (or the min-wise independent permutations locality-sensitive hashing scheme) is a technique for quickly estimating…
- Random permutation A random permutation is a sequence where any order of its items is equally likely at random, that is, it is a permutation-valued random variable of a set…
- Order statistic In statistics, the kth order statistic of a statistical sample is equal to its kth-smallest value. Given a sample of size n, the kth order statistic is…
- Hash function A hash function is any function that can be used to map data of arbitrary size to fixed-size values, though there are some hash functions that support…