Abstract
In this work, a new algorithm for drawing a weighted random sample of size m from a population of n weighted items, where m⩽n, is presented. The algorithm can generate a weighted random sample in one-pass over unknown populations.
EUCLID / RESEARCH OUTPUT
Journal Article
Information Processing Letters · Mar 2006
In this work, a new algorithm for drawing a weighted random sample of size m from a population of n weighted items, where m⩽n, is presented. The algorithm can generate a weighted random sample in one-pass over unknown populations.
CITATION
@article{Efraimidis_2006,
title={Weighted random sampling with a reservoir},
volume={97},
ISSN={0020-0190},
url={http://dx.doi.org/10.1016/j.ipl.2005.11.003},
DOI={10.1016/j.ipl.2005.11.003},
number={5},
journal={Information Processing Letters},
publisher={Elsevier BV},
author={Efraimidis, Pavlos S. and Spirakis, Paul G.},
year={2006},
month=Mar,
pages={181–185}
}