MétaCan
Menu
Back to cohort
Record W1732143764 · doi:10.48550/arxiv.1301.6748

Contextual Weak Independence in Bayesian Networks

2013· preprint· en· W1732143764 on OpenAlexaff
Cory J. Butz

Bibliographic record

VenuearXiv (Cornell University) · 2013
Typepreprint
Languageen
FieldComputer Science
TopicBayesian Modeling and Causal Inference
Canadian institutionsUniversity of Regina
Fundersnot available
KeywordsIndependence (probability theory)Conditional independenceContext (archaeology)Probabilistic logicConsistency (knowledge bases)Bayesian networkRepresentation (politics)InferenceClass (philosophy)Computer scienceMathematicsArtificial intelligenceStatisticsPolitical scienceGeography

Abstract

fetched live from OpenAlex

It is well-known that the notion of (strong) conditional independence (CI) is too restrictive to capture independencies that only hold in certain contexts. This kind of contextual independency, called context-strong independence (CSI), can be used to facilitate the acquisition, representation, and inference of probabilistic knowledge. In this paper, we suggest the use of contextual weak independence (CWI) in Bayesian networks. It should be emphasized that the notion of CWI is a more general form of contextual independence than CSI. Furthermore, if the contextual strong independence holds for all contexts, then the notion of CSI becomes strong CI. On the other hand, if the weak contextual independence holds for all contexts, then the notion of CWI becomes weak independence (WI) nwhich is a more general noncontextual independency than strong CI. More importantly, complete axiomatizations are studied for both the class of WI and the class of CI and WI together. Finally, the interesting property of WI being a necessary and sufficient condition for ensuring consistency in granular probabilistic networks is shown.

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.008
metaresearch head score (Gemma)0.027
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.008
Threshold uncertainty score0.044

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0080.027
Meta-epidemiology (narrow)0.0010.002
Meta-epidemiology (broad)0.0010.002
Bibliometrics0.0030.004
Science and technology studies0.0020.006
Scholarly communication0.0040.008
Open science0.0020.004
Research integrity0.0020.006
Insufficient payload (model declined to judge)0.0030.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.063
GPT teacher head0.193
Teacher spread0.130 · 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

Citations23
Published2013
Admission routes1
Has abstractyes

Explore more

Same venuearXiv (Cornell University)Same topicBayesian Modeling and Causal InferenceFrench-language works237,207