Sequential random sampling-Reference-Cited by-同舟云学术

Sequential random sampling

Published:1985-06 Issue:2 Volume:11 Page:157-169
ISSN:0098-3500
Container-title:ACM Transactions on Mathematical Software
language:en
Short-container-title:ACM Trans. Math. Softw.

Author:

Ahrens J. H.¹,Dieter U.²

Affiliation:

1. Mathematisches Seminar, Universität Kiel, Olshausenstrasse 40-60, D 2300 Kiel, Federal Republic of Germany

2. Institut für Statistik, Universität Graz, Lessingstrasse 27, A 8010 Graz, Austria

Abstract

Fast algorithms for selecting a random set of exactly k records from a file of n records are constructed. Selection is sequential: the sample records are chosen in the same order in which they occur in the file. All procedures run in O(k) time. The “geometric” method has two versions: with or without O(k) auxiliary space. A further procedure uses hashing techniques and requires O(k) space.

Publisher

Association for Computing Machinery (ACM)

Subject

Applied Mathematics,Software

Link

https://dl.acm.org/doi/pdf/10.1145/214392.214402

Reference10 articles.

1. Computer methods for sampling from the exponential and normal distributions

2. Development of sampling plans by using sequential (item by item) selection techniques and digital computers, j;FAN C. W.;Am. Statist. Assoc.,1962

3. A note on sampling a tape-file

Cited by 23 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Point cluster analysis using weighted random labeling;Journal of Geographical Systems;2024-09-10

2. Fiat–Shamir Transformation of Multi-Round Interactive Proofs (Extended Version);Journal of Cryptology;2023-08-08

3. Efficiently generating geometric inhomogeneous and hyperbolic random graphs;Network Science;2022-11-23

4. Parallel Weighted Random Sampling;ACM Transactions on Mathematical Software;2022-09-10

5. Is Deep Learning a Valid Approach for Inferring Subjective Self-Disclosure in Human-Robot Interactions?;2022 17th ACM/IEEE International Conference on Human-Robot Interaction (HRI);2022-03-07