MétaCan
Menu
Back to cohort
Record W2495717638 · doi:10.1017/cbo9780511804861.004

Probability distributions, expectation and prevision

2005· book-chapter· en· W2495717638 on OpenAlexaff
Ian Jordaan

Bibliographic record

VenueCambridge University Press eBooks · 2005
Typebook-chapter
Languageen
FieldDecision Sciences
TopicSimulation Techniques and Applications
Canadian institutionsMemorial University of Newfoundland
Fundersnot available
KeywordsStatistical physicsMathematicsEconometricsPhysics

Abstract

fetched live from OpenAlex

Bring out number, weight and measure in a year of dearth. William Blake, Proverbs of Hell Probability distributions We are now in the following situation. We have a probability mass of unity, and we wish to distribute this over the possible outcomes of events and quantities of interest. We also wish to manipulate the results to assist in decision-making. We have so far considered mainly random events, which may take the value 0 or 1. A common idealized example that we have given is that of red and pink balls in an urn, which we have labelled 1 and 0, respectively. Thus, the statement E = ‘the ball drawn from the urn is red’ becomes E = 0 or E = 1, depending on whether we draw a pink or red ball. The event E either happens or it does not, and there are only two possible outcomes. Random quantities can have more than two outcomes. For the case of drawings from an urn, the random quantity could be the number of red balls in ten (or any other number) of drawings, for example from Raiffa's urns of Figure 2.10. A further example is the throwing of a die which can result in six possible outcomes; the drawing of a card from a deck can result in 52 possible outcomes, and so on.

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.

How this classification was reachedexpand

Full frame machine prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.

metaresearch head score (Codex)0.006
metaresearch head score (Gemma)0.016
Version: metacan-v3-hybrid-931329e0061cValidation 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.012
Threshold uncertainty score0.039

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0060.016
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0020.002
Science and technology studies0.0010.008
Scholarly communication0.0060.010
Open science0.0020.002
Research integrity0.0020.003
Insufficient payload (model declined to judge)0.0120.002

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.100
GPT teacher head0.308
Teacher spread0.208 · 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

Classification

machine, unvalidated

Machine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designTheoretical or conceptual
Domainnot available
GenreMethods

How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".

Quick stats

Citations0
Published2005
Admission routes1
Has abstractyes

Explore more

Same venueCambridge University Press eBooksSame topicSimulation Techniques and ApplicationsFrench-language works237,207