Ranked reservoir sampling: an extension to the reservoir sampling algorithm

Authors:
C. C. Kirkham
Affiliations:
School of Computer Science, The University of Manchester, Oxford Road, Manchester M13 9PL, U.K.
Venue:
Software—Practice & Experience
Year:
2007

Citing 2
Cited 0

Random sampling with a reservoir

ACM Transactions on Mathematical Software (TOMS)
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms

The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms

Quantified Score

Hi-index	0.01

Visualization

Abstract

This paper describes a simple extension to the reservoir sampling algorithm to allow its use with ranked records. Here the fixed-sized sample must include records in order of rank, but a fair selection must occur to choose the lowest-ranked records included. The result is produced after a single pass through the records. Copyright © 2007 John Wiley & Sons, Ltd.