A Bayesian Network Approach to Causation Analysis of Road Accidents Using Netica
Bibliographic record
Abstract
Based on an overall consideration of factors affecting road safety evaluations, the Bayesian network theory based on probability risk analysis was applied to the causation analysis of road accidents. By taking Adelaide Central Business District (CBD) in South Australia as a case, the Bayesian network structure was established by integrating K2 algorithm with experts’ knowledge, and Expectation-Maximization algorithm that could process missing data was adopted to conduct the parameter learning in Netica, thereby establishing the Bayesian network model for the causation analysis of road accidents. Then Netica was used to carry out posterior probability reasoning, the most probable explanation, and inferential analysis. The results showed that the Bayesian network model could effectively explore the complex logical relation in road accidents and express the uncertain relation among related variables. The model not only can quantitatively predict the probability of an accident in certain road traffic condition but also can find the key reasons and the most unfavorable state combination which leads to the occurrence of an accident. The results of the study can provide theoretical support for urban road management authorities to thoroughly analyse the induction factors of road accidents and then establish basis in improving the safety performance of the urban road traffic system.
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.003 | 0.010 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.002 |
| Bibliometrics | 0.005 | 0.003 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.002 | 0.003 |
| Open science | 0.002 | 0.001 |
| Research integrity | 0.001 | 0.002 |
| Insufficient payload (model declined to judge) | 0.004 | 0.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.
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".