Weighted sampling without replacement from data streams

Information Processing Letters(2015)

引用 16|浏览90
暂无评分
摘要
New results for sampling in the streaming model.A new method of performing weighted random sampling without replacement using weighted random sampling with replacement.The new sampling algorithm avoids losing error when using finite precision. Weighted sampling without replacement has proved to be a very important tool in designing new algorithms. Efraimidis and Spirakis 5 presented an algorithm for weighted sampling without replacement from data streams. Their algorithm works under the assumption of precise computations over the interval 0 , 1 . Cohen and Kaplan 3 used similar methods for their bottom-k sketches.Efraimidis and Spirakis ask as an open question whether using finite precision arithmetic impacts the accuracy of their algorithm. In this paper we show a method to avoid this problem by providing a precise reduction from k-sampling without replacement to k-sampling with replacement. We call the resulting method Cascade Sampling.
更多
查看译文
关键词
Algorithms,On-line algorithms,Sampling,Streaming algorithms
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要