Weighted Random Sampling: 2005; Efraimidis, Spirakis
Integrity signals
Registry
Cites
Statistics
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
The sampling weights were adjusted based on the disease count in each type and moderated by natural logarithm transformation.
“The sampling weights were adjusted based on the disease count in each type and moderated by natural logarithm transformation43,44.”
From Enhancing diagnostic capability with multi-agents conversational large language models (2025) · cites this paper as [43]
Cites
The Art of Computer Programming
Knuth, D. E. (1968) · Cited by 16,097 · see citing works
Non-Uniform Random Variate Generation
Devroye, L. (1986) · Springer eBooks · doi:10.1007/978-1-4613-8643-8 · Cited by 4,110 · see citing works
Models and issues in data stream systems
Babcock, B., Babu, S., Datar, M., Motwani, R., & Widom, J. (2002) · ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS) · doi:10.1145/543613.543615 · Cited by 2,542 · see citing works
Random sampling with a reservoir
Vitter, J. S. (1985) · ACM Transactions on Mathematical Software · doi:10.1145/3147.3165 · Cited by 1,789 · see citing works
Data Streams: Algorithms and Applications
Muthukrishnan, S. (2005) · now publishers, Inc. eBooks · doi:10.1561/9781933019604 · Cited by 1,472 · see citing works
The art of computer programming. Vol.2: Seminumerical algorithms
Knuth, D. E. (1981) · Virtual Defense Library (Ministerio de Defensa) · Cited by 1,227 · see citing works
Weighted random sampling with a reservoir
Efraimidis, P. S., & Spirakis, P. G. (2005) · Information Processing Letters · doi:10.1016/j.ipl.2005.11.003 · Cited by 370 · see citing works
Self-citatione-approximations with minimum packing constraint violation (extended abstract)
Lin, J.-H., & Vitter, J. S. (1992) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/129712.129787 · Cited by 215 · see citing works
Approximations with Minimum Packing Constraint Violation
Lin, J. C., & Vitter, J. S. (1992) · Cited by 148 · see citing works
Faster methods for random sampling
Vitter, J. S. (1984) · Communications of the ACM · doi:10.1145/358105.893 · Cited by 120 · see citing works
Online maintenance of very large random samples
Jermaine, C., Pol, A., & Arumugam, S. (2004) · Proceedings - ACM-SIGMOD International Conference on Management of Data · doi:10.1145/1007568.1007603 · Cited by 48 · see citing works
Ahrens, J. H., & Dieter, U. (1985) · ACM Transactions on Mathematical Software · doi:10.1145/214392.214402 · Cited by 30 · see citing works
An efficient parallel algorithm for random sampling
Rajan, V., Ghosh, R. K., & Gupta, P. (1989) · Information Processing Letters · doi:10.1016/0020-0190(89)90206-8 · Cited by 13 · see citing works
Flagged first, then by citations
Cited by
Sorted by citations
van Grinsven, M. J. J. P., van Ginneken, B., Hoyng, C. B., Theelen, T., & Sanchez, C. I. (2016) · IEEE Transactions on Medical Imaging · doi:10.1109/tmi.2016.2526689 · Cited by 426 · see citing works
Enhancing diagnostic capability with multi-agents conversational large language models
Chen, X., Yi, H., You, M., Liu, W., Wang, L., Li, H., Zhang, X., Guo, Y., Fan, L., Chen, G., et al. (2025) · npj Digital Medicine · doi:10.1038/s41746-025-01550-0 · Cited by 117 · see citing works
- Authors
- Efraimidis, P., & Spirakis, P.
- Affiliations
- Democritus University of Thrace (GR)
- Computer Technology Institute and Press “DIOPHANTUS” (GR)
- Venue
- Encyclopedia of Algorithms
- Publisher
- Springer US
- Published
- 2008
- Pages
- 1024-1027
- OpenAlex
- W1909281155
- Cited by
- 45
- References
- 13
- Citations by year
- 2026: 4 · 2025: 7 · 2024: 5 · 2023: 5 · 2022: 6 · 2021: 5 · 2020: 2 · 2019: 1 · 2017: 1 · 2016: 2 · 2015: 3 · 2012: 1
- Type
- reference entry
- Language
- en
- Open access
- closed
- Locations
- Encyclopedia of Algorithms (publishedVersion)
- Topics
- Physical Sciences › Computer Science › Computer Networks and Communications › Advanced Database Systems and Queries
- Physical Sciences › Computer Science › Artificial Intelligence › Algorithms and Data Compression
- Physical Sciences › Mathematics › Statistics and Probability › Markov Chains and Monte Carlo Methods
- Keywords
- weighted random sampling, reservoir sampling, data streams, random sampling algorithms, sampling without replacement, epsilon-approximation, sampling with replacement
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
