The DOI matches its Crossref record; 4 of the 4 references it cites were found in a registry or an index.
Random sampling with a reservoir
Open accessAbstract
We introduce fast algorithms for selecting a random sample of n records without replacement from a pool of N records, where the value of N is unknown beforehand. The main result of the paper is the design and analysis of Algorithm Z; it does the sampling in one pass using constant space and in O ( n (1 + log( N/n ))) expected time, which is optimum, up to a constant factor. Several optimizations are studied that collectively improve the speed of the naive version of the algorithm by an order of magnitude. We give an efficient Pascal-like implementation that incorporates these modifications and that is suitable for general use. Theoretical and empirical results indicate that Algorithm Z outperforms current methods by a significant margin.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
An introduction to probability theory and its applications
(1958) · Journal of the Franklin Institute · doi:10.1016/0016-0032(58)90688-4 · Cited by 29,269
The Art of Computer Programming
Knuth, D. E. (1968) · Cited by 16,337
Proceedings. 45th Annual IEEE Symposium on Foundations of Computer Science
(2004) · 45th Annual IEEE Symposium on Foundations of Computer Science · doi:10.1109/focs.2004.4 · Cited by 805
Faster methods for random sampling
Vitter, J. S. (1984) · Communications of the ACM · doi:10.1145/358105.893 · Cited by 124
Self-citation
Cited by
Data Mining: Practical Machine Learning Tools and Techniques
(2011) · Elsevier eBooks · doi:10.1016/c2009-0-19715-5 · Cited by 25,437
The WEKA data mining software: an update
Hall, M., Frank, E., Holmes, G., Pfahringer, B., Reutemann, P., & Witten, I. H. (2009) · ACM SIGKDD Explorations Newsletter · doi:10.1145/1656274.1656278 · Cited by 17,750
“• Reservoir sample [33]: processes instances incrementally and performs reservoir sampling, for down-sampling data sets that do not fit in main memory.”
A survey on concept drift adaptation
Gama, J., Žliobaitė, I., Bifet, A., Pechenizkiy, M., & Bouchachia, A. (2014) · ACM Computing Surveys · doi:10.1145/2523813 · Cited by 3,735
Practical Black-Box Attacks against Machine Learning
Papernot, N., McDaniel, P., Goodfellow, I., Jha, S., Celik, Z. B., & Swami, A. (2017) · Proceedings of the 2017 ACM on Asia Conference on Computer and Communications Security · doi:10.1145/3052973.3053009 · Cited by 3,495
Models and issues in data stream systems
Babcock, B., Babu, S., Datar, M., Motwani, R., & Widom, J. (2002) · Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems · doi:10.1145/543613.543615 · Cited by 2,495
Rajaraman, A., & Ullman, J. D. (2011) · Cambridge University Press eBooks · doi:10.1017/cbo9781139058452 · Cited by 2,262
CURE: an efficient clustering algorithm for large databases
Guha, S., Rastogi, R., & Shim, K. (1998) · Proceedings of the 1998 ACM SIGMOD international conference on Management of data · doi:10.1145/276304.276312 · Cited by 1,907
Rock: A robust clustering algorithm for categorical attributes
Guha, S., Rastogi, R., & Shim, K. (2000) · Information Systems · doi:10.1016/s0306-4379(00)00022-3 · Cited by 1,472
Transferability in Machine Learning: from Phenomena to Black-Box Attacks using Adversarial Samples
Papernot, N., McDaniel, P., & Goodfellow, I. (2016) · arXiv · doi:10.48550/arxiv.1605.07277 · Cited by 1,326
Approximate frequency counts over data streams
Manku, G. S., & Motwani, R. (2012) · Proceedings of the VLDB Endowment · doi:10.14778/2367502.2367508 · Cited by 1,178
The CQL continuous query language: semantic foundations and query execution
Arasu, A., Babu, S., & Widom, J. (2006) · The VLDB Journal · doi:10.1007/s00778-004-0147-z · Cited by 1,170
Approximate Frequency Counts over Data Streams
Manku, G. S., & Motwani, R. (2002) · VLDB '02: Proceedings of the 28th International Conference on Very Large Databases · doi:10.1016/b978-155860869-6/50038-x · Cited by 941
MatchNet: Unifying feature and metric learning for patch-based matching
Han, X., Leung, T., Jia, Y., Sukthankar, R., & Berg, A. C. (2015) · 2015 IEEE Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr.2015.7298948 · Cited by 825
Learning in Nonstationary Environments: A Survey
Ditzler, G., Roveri, M., Alippi, C., & Polikar, R. (2015) · IEEE Computational Intelligence Magazine · doi:10.1109/mci.2015.2471196 · Cited by 793
CURE: an efficient clustering algorithm for large databases
Guha, S., Rastogi, R., & Shim, K. (1998) · ACM SIGMOD Record · doi:10.1145/276305.276312 · Cited by 669
Fast and accurate image upscaling with super-resolution forests
Schulter, S., Leistner, C., & Bischof, H. (2015) · 2015 IEEE Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr.2015.7299003 · Cited by 618
ROCK: a robust clustering algorithm for categorical attributes
Guha, S., Rastogi, R., & Shim, K. (1999) · Proceedings 15th International Conference on Data Engineering (Cat. No.99CB36337) · doi:10.1109/icde.1999.754967 · Cited by 609
Streaming-data algorithms for high-quality clustering
O'Callaghan, L., Mishra, N., Meyerson, A., Guha, S., & Motwani, R. (2003) · Proceedings 18th International Conference on Data Engineering · doi:10.1109/icde.2002.994785 · Cited by 577
Efficient Human Pose Estimation from Single Depth Images
Shotton, J., Girshick, R., Fitzgibbon, A., Sharp, T., Cook, M., Finocchio, M., Moore, R., Kohli, P., Criminisi, A., Kipman, A., et al. (2013) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2012.241 · Cited by 576
Improved histograms for selectivity estimation of range predicates
Poosala, V., Haas, P. J., Ioannidis, Y. E., & Shekita, E. J. (1996) · Proceedings of the 1996 ACM SIGMOD international conference on Management of data - SIGMOD '96 · doi:10.1145/233269.233342 · Cited by 556
Fast Monte Carlo Algorithms for Matrices I: Approximating Matrix Multiplication
Drineas, P., Kannan, R., & Mahoney, M. W. (2006) · SIAM Journal on Computing · doi:10.1137/s0097539704442684 · Cited by 487
Dark Experience for General Continual Learning: a Strong, Simple Baseline
Buzzega, P., Boschini, M., Porrello, A., Abati, D., & Calderara, S. (2020) · arXiv · doi:10.48550/arxiv.2004.07211 · Cited by 473
Synopses for Massive Data: Samples, Histograms, Wavelets, Sketches
Cormode, G., Garofalakis, M., Haas, P. J., & Jermaine, C. (2011) · Foundations and Trends in Databases · doi:10.1561/1900000004 · Cited by 468
Online continual learning in image classification: An empirical survey
Mai, Z., Li, R., Jeong, J., Quispe, D., Kim, H., & Sanner, S. (2022) · Neurocomputing · doi:10.1016/j.neucom.2021.10.021 · Cited by 410
Rainbow Memory: Continual Learning with a Memory of Diverse Samples
Bang, J., Kim, H., Yoo, Y., Ha, J.-W., & Choi, J. (2021) · 2021 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr46437.2021.00812 · Cited by 354
Weighted random sampling with a reservoir
Efraimidis, P. S., & Spirakis, P. G. (2006) · Information Processing Letters · doi:10.1016/j.ipl.2005.11.003 · Cited by 353
Efficient regression of general-activity human poses from depth images
Girshick, R., Shotton, J., Kohli, P., Criminisi, A., & Fitzgibbon, A. (2011) · 2011 International Conference on Computer Vision · doi:10.1109/iccv.2011.6126270 · Cited by 344
AUC Maximization in the Era of Big Data and AI: A Survey
Yang, T., & Ying, Y. (2023) · ACM Computing Surveys · doi:10.1145/3554729 · Cited by 323
Processing complex aggregate queries over data streams
Dobra, A., Garofalakis, M., Gehrke, J., & Rastogi, R. (2002) · Proceedings of the 2002 ACM SIGMOD international conference on Management of data · doi:10.1145/564691.564699 · Cited by 319
Evolutionary Network Analysis: A Survey
Aggarwal, C., & Subbian, K. (2014) · ACM Computing Surveys · doi:10.1145/2601412 · Cited by 313
Streaming submodular maximization: massive data summarization on the fly
Badanidiyuru, A., Mirzasoleiman, B., Karbasi, A., & Krause, A. (2014) · Proceedings of the 20th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/2623330.2623637 · Cited by 300
On Tiny Episodic Memories in Continual Learning
Chaudhry, A., Rohrbach, M., Elhoseiny, M., Ajanthan, T., Dokania, P. K., Torr, P. H. S., & Ranzato, M. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1902.10486 · Cited by 298
Towards automatic optimization of MapReduce programs
Babu, S. (2010) · Proceedings of the 1st ACM symposium on Cloud computing · doi:10.1145/1807128.1807150 · Cited by 283
A survey of data partitioning and sampling methods to support big data analysis
Mahmud, M. S., Huang, J. Z., Salloum, S., Emara, T. Z., & Sadatdiynov, K. (2020) · Big Data Mining and Analytics · doi:10.26599/bdma.2019.9020015 · Cited by 282
PINT: Probabilistic In-band Network Telemetry
Ben Basat, R., Ramanathan, S., Li, Y., Antichi, G., Yu, M., & Mitzenmacher, M. (2020) · Proceedings of the Annual conference of the ACM Special Interest Group on Data Communication on the applications, technologies, architectures, and protocols for computer communication · doi:10.1145/3387514.3405894 · Cited by 268
(2019) · arXiv (Cornell University) · Cited by 214
Resolving systematic errors in widely used enhancer activity assays in human cells
Muerdter, F., Boryń, Ł. M., Woodfin, A. R., Neumayr, C., Rath, M., Zabidi, M. A., Pagani, M., Haberle, V., Kazmar, T., Catarino, R. R., et al. (2018) · Nature Methods · doi:10.1038/nmeth.4534 · Cited by 208
DualNet: Continual Learning, Fast and Slow
Pham, Q., Liu, C., & Hoi, S. (2021) · arXiv · doi:10.48550/arxiv.2110.00175 · Cited by 84
Incremental Learning of NCM Forests for Large-Scale Image Classification
Ristin, M., Guillaumin, M., Gall, J., & Van Gool, L. (2014) · 2014 IEEE Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2014.467 · Cited by 82
Pandey, R., Purohit, H., Castillo, C., & Shalin, V. L. (2022) · International Journal of Human-Computer Studies · doi:10.1016/j.ijhcs.2022.102772 · Cited by 47
Weighted Random Sampling: 2005; Efraimidis, Spirakis
Efraimidis, P., & Spirakis, P. (2008) · Encyclopedia of Algorithms · doi:10.1007/978-0-387-30162-4_478 · Cited by 45
Crowdsourced Rumour Identification During Emergencies
McCreadie, R., Macdonald, C., & Ounis, I. (2015) · Proceedings of the 24th International Conference on World Wide Web · doi:10.1145/2740908.2742573 · Cited by 25
Verse: Virtual-gradient aware streaming lifelong learning with anytime inference
Banerjee, S., Verma, V. K., Mukherjee, A., Gupta, D., Namboodiri, V. P., & Rai, P. (2024) · 2024 IEEE International Conference on Robotics and Automation (ICRA) · doi:10.1109/icra57147.2024.10610702 · Cited by 3
Online continual streaming learning for embedded space applications
Mazouz, A. E., & Nguyen, V.-T. (2024) · Journal of Real-Time Image Processing · doi:10.1007/s11554-024-01438-4 · Cited by 3
Metadata
- Authors
- Vitter, J. S.
- Venue
- ACM Transactions on Mathematical Software
- Published
- 1985-03
- Volume
- 11
- Issue
- 1
- Pages
- 37-57
- ISSN
- 0098-3500 (ISSN-L)
- 1557-7295
- OpenAlex
- W2119885577
- Cited by
- 1,758
- References
- 4
- FWCI
- 0.85
- Type
- journal article
- Language
- en
- Open access
- bronze
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.