MétaCan
Menu
Back to cohort
Record W4221014773 · doi:10.37394/232020.2022.2.11

Classic Probability Revisited (II): Algebraic Operations of the Extended Probability Theory

2022· article· en· W4221014773 on OpenAlexafffund
Yingxu Wang

Bibliographic record

VenuePROOF · 2022
Typearticle
Languageen
FieldComputer Science
TopicCognitive Computing and Networks
Canadian institutionsUniversity of Calgary
FundersNatural Sciences and Engineering Research Council of Canada
KeywordsConditional probabilityProbability theoryTree diagramBayes' theoremComputer scienceLaw of total probabilityApplied probabilityInferenceProbability measureTheoretical computer scienceAlgebraic numberEvent (particle physics)Probability distributionMathematicsBayesian probabilityArtificial intelligenceDiscrete mathematicsPosterior probability

Abstract

fetched live from OpenAlex

Part II of this paper presents a set of comprehensive algebraic operators on the extended mathematical structures of the general probability theory. It is recognized that the classic probability theory is cyclically defined among a small set of highly coupled operations. In order to solve this fundamental problem, a reductive framework of the general probability theory is introduced. It is found that conditional probability operation on consecutive events is the key to independently manipulate other probability operations. This leads to a revisited framework of rigorous manipulations on general probabilities. It also provides a proof for a revisited Bayes’ law fitting in more general contexts of variant sample spaces and complex event relations in fundamental probability theories. The revisited probability theory enables a rigorous treatment of uncertainty events and causations in formal inference, qualification, quantification, and semantic analysis in contemporary fields such as cognitive informatics, computational intelligence, cognitive robots, complex systems, soft computing, and brain informatics.

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.002
metaresearch head score (Gemma)0.005
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: Empirical · Consensus signal: none
Teacher disagreement score0.004
Threshold uncertainty score0.015

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0020.005
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0020.001
Science and technology studies0.0010.007
Scholarly communication0.0030.008
Open science0.0010.003
Research integrity0.0010.003
Insufficient payload (model declined to judge)0.0040.001

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.022
GPT teacher head0.241
Teacher spread0.219 · 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
GenreEmpirical

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

Citations1
Published2022
Admission routes2
Has abstractyes

Explore more

Same venuePROOFSame topicCognitive Computing and NetworksFrench-language works237,207