A Bayesian Belief Network Approach for Modeling Complex Domains
Bibliographic record
Abstract
Bayesian belief networks (BBNs) are increasingly used for understanding and simulating computational models in many domains. Though BBN techniques are elegant ways of capturing uncertainties, knowledge engineering effort required to create and initialize the network has prevented many researchers from using them. Even though the structure of the network and its conditional & initial probabilities could be learned from data, data is not always available or it is too costly to obtain. In addition, current algorithms that can be used to learn relationships among variables, initial and conditional probabilities from data are often complex and cumbersome to employ. Qualitative-based approaches applied to the creation of graphical models can be used to create initial computational models that can help researchers analyze complex problems and provide guidance and support for decision-making. Initial BBN models can be refined once appropriate data is obtained. This chapter extends the use of BBNs to help experts make sense of complex social systems (e.g., social capital in virtual learning communities) using a Bayesian model as an interactive simulation tool. Scenarios are used to find out whether the model is consistent with the expert’s beliefs. The sensitivity analysis was conducted to help explain how the model reacted to different sets of evidence. Currently, we are in the process of refining the initial probability values presented in the model using empirical data and developing more authentic scenarios to further validate the model.
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 imitationNot 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.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.002 | 0.006 |
| Meta-epidemiology (narrow) | 0.002 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.002 | 0.004 |
| Science and technology studies | 0.001 | 0.002 |
| Scholarly communication | 0.004 | 0.004 |
| Open science | 0.003 | 0.002 |
| Research integrity | 0.003 | 0.004 |
| Insufficient payload (model declined to judge) | 0.010 | 0.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.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
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".