MétaCan
Menu
Back to cohort
Record W1492735889 · doi:10.1002/9781118162934.ch2

Simple Random Sampling

2012· other· en· W1492735889 on OpenAlex

Why this work is in the frame

A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.

Bibliographic record

VenueWiley series in probability and statistics · 2012
Typeother
Languageen
FieldComputer Science
TopicBayesian Methods and Mixture Models
Canadian institutionsSimon Fraser University
Fundersnot available
KeywordsSimple random sampleCluster samplingSampling (signal processing)Poisson samplingStatisticsSampling designMathematicsSlice samplingEstimatorSystematic samplingPopulationBias of an estimatorSample (material)Simple (philosophy)Importance samplingComputer scienceMinimum-variance unbiased estimatorMonte Carlo method

Abstract

fetched live from OpenAlex

Simple random sampling, or random sampling without replacement, is a sampling design in which n distinct units are selected from the N units in the population in such a way that every possible combination of n units is equally likely to be the sample selected. This chapter begins with a discussion of selecting a simple random sample. With simple random sampling, the sample mean is an unbiased estimator of the population mean. Also with simple random sampling, the sample variance is an unbiased estimator of the finite-population variance. The chapter then discusses random sampling with replacement. It presents derivations for random sampling and describes model-based approach to sampling. The chapter finally illustrates simple computations for sampling using the open-source statistical programming language R. Controlled Vocabulary Terms estimator; mean; random sampling; variance

Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.

Full frame distilled prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.

metaresearch head score (Codex)0.001
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Theoretical or conceptual · Consensus signal: Theoretical or conceptual
GenreCandidate signal: Methods · Consensus signal: Methods
Teacher disagreement score0.296
Threshold uncertainty score0.967

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0000.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.000

Machine scores (provisional)

The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.

Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.

Opus teacher head0.027
GPT teacher head0.283
Teacher spread0.255 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it