MétaCan
Menu
Back to cohort
Record W1893612249 · doi:10.1109/ismvl.2015.42

Belief Network Support via Decision Diagrams

2015· article· en· W1893612249 on OpenAlex
Shawn C. Eastwood, Svetlana Yanushkevich, Vlad P. Shmerko

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 Calgary
Fundersnot available
KeywordsBayesian networkBinary decision diagramComputer scienceConditional probabilityInfluence diagramDecision tableTheoretical computer scienceGraphical modelTable (database)Representation (politics)EmbeddingNode (physics)Law of total probabilityBayesian probabilityData miningAlgorithmMachine learningArtificial intelligenceMathematicsDecision treePosterior probabilityRough setStatistics

Abstract

fetched live from OpenAlex

This paper proposes improving the efficiency of belief (Bayesian) networks (BNs) by embedding decision diagrams (DDs) in place of the conditional probability tables (distributed local memories of BNs). The resulting hybrid graphical data structure is a high-efficiency BN which can be used for the modelling of large-scale multi-state systems. For example if the number of values attainable by all nodes is r, and the number of parent nodes of the current node is n, then the complexity of the representation of a conditional probability table (CPT) is reduced in some cases from O(rn+1) to O(rn) when the conditional probability tables are replaced with DDs. The approach is demonstrated via illustrative examples for binary and ternary systems.

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 categoriesInsufficient payload (model declined to judge)
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Other design · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.731
Threshold uncertainty score1.000

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.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.039
GPT teacher head0.268
Teacher spread0.229 · 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

Citations1
Published2015
Admission routes1
Has abstractyes

Explore more

Same topicBayesian Modeling and Causal InferenceFrench-language works237,207