论文信息 - Weighted random sampling with a reservoir - 字舞流文

Weighted random sampling with a reservoir

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.

Paul G. Spirakis | Pavlos S. Efraimidis | P. Efraimidis | P. Spirakis

[1] Rajeev Motwani,et al. On random sampling over joins , 1999, SIGMOD '99.

[2] Jeffrey Scott Vitter,et al. Random sampling with a reservoir , 1985, TOMS.

[3] S. Muthukrishnan,et al. Data streams: algorithms and applications , 2005, SODA '03.

[4] P. Gupta,et al. An Efficient Parallel Algorithm for Random Sampling , 1989, Inf. Process. Lett..

[5] Kim-Hung Li,et al. Reservoir-sampling algorithms of time complexity O(n(1 + log(N/n))) , 1994, TOMS.

[6] David R. Karger,et al. Random sampling in cut, flow, and network design problems , 1994, STOC '94.

[7] Jeffrey Scott Vitter,et al. e-approximations with minimum packing constraint violation (extended abstract) , 1992, STOC '92.

[8] Donald Ervin Knuth,et al. The Art of Computer Programming , 1968 .

[9] Jeffrey Scott Vitter,et al. Faster methods for random sampling , 1984, CACM.

[10] Jennifer Widom,et al. Models and issues in data stream systems , 2002, PODS.

[11] Frank Olken,et al. Random Sampling from Databases , 1993 .

[12] Chak-Kuen Wong,et al. An Efficient Method for Weighted Sampling Without Replacement , 1980, SIAM J. Comput..

[13] David R. Karger,et al. Random sampling in residual graphs , 2002, STOC '02.

[14] L. Devroye. Non-Uniform Random Variate Generation , 1986 .