Premium
Ranked reservoir sampling: an extension to the reservoir sampling algorithm
Author(s) -
Kirkham C. C.
Publication year - 2007
Publication title -
software: practice and experience
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.437
H-Index - 70
eISSN - 1097-024X
pISSN - 0038-0644
DOI - 10.1002/spe.805
Subject(s) - extension (predicate logic) , sampling (signal processing) , simple random sample , rank (graph theory) , sample (material) , computer science , selection (genetic algorithm) , algorithm , statistics , data mining , mathematics , artificial intelligence , programming language , combinatorics , telecommunications , sociology , population , chemistry , demography , chromatography , detector
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.