MétaCan
Menu
Back to cohort
Record W1496276719

Generating Dependence Structure of Multiply Sectioned Bayesian Networks

2001· article· en· W1496276719 on OpenAlex
Yang Xiang, Xiangdong An

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

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicBayesian Modeling and Causal Inference
Canadian institutionsUniversity of Guelph
Fundersnot available
KeywordsComputer scienceBayesian networkFocus (optics)Set (abstract data type)InferenceBayesian probabilityAlgorithmInterpretation (philosophy)Construct (python library)Theoretical computer scienceArtificial intelligenceData mining
DOInot available

Abstract

fetched live from OpenAlex

Multiply sectioned Bayesian networks (MSBNs) pro-vide a general and exact framework for multi-agent dis-tributed interpretation. To investigate algorithms for inference and other operations, experimental MSBNs are necessary. However, it is very time consuming and tedious to construct MSBNs manually. In this work, we investigate pseduo-random generation of MSBNs. Our focus is on the generation of MSBN structures. Pseduo-random generation of MSBN structures can be performed by a generate-and-test approach. We ex-pect such approach to have a very low probability of generating legal MSBN structures that satisfy all the technical constraints, and hence will be ineÆcient. We propose a set of algorithms that always generates legal MSBN dependence structures. 1

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.000
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: Simulation or modeling · Consensus signal: Simulation or modeling
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.747
Threshold uncertainty score0.418

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.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.0010.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.015
GPT teacher head0.240
Teacher spread0.224 · 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

Quick stats

Citations0
Published2001
Admission routes1
Has abstractyes

Explore more

Same topicBayesian Modeling and Causal InferenceFrench-language works237,207