Skip to main content
Search

# Bayesian Network

2 related articles

Subscribe to updates
  1. Swapping hill-climbing for tabu search in Bayesian network learning: PCTABU wins on sparse networks and ties on dense ones

    Hybrid Bayesian network learning separates skeleton construction from score-based search, and both the search strategy (hill-climbing or tabu) and the scoring function (BDe, LL or BIC) change the learned structure. PCTABU pairs the PC skeleton with tabu search; against PCHC on eight real benchmark networks it did better on the sparser Alarm, Child and Hailfinder, tied on the other five, and LL scored worst for both algorithms while BDe and BIC performed similarly.

  2. Subway fire risk stops relying on hand-picked nodes: a graph network selects 22 from a 666-node knowledge graph, lifting high-casualty probability from 6.58% to 53.2%

    Subway fire risk assessment has long depended on experts manually choosing Bayesian network nodes, which is subjective and hard to adapt. This pipeline extracts 215 fire keywords and six risk labels from accident records and fire codes with natural language processing, builds a 666-node knowledge graph, classifies nodes with a three-layer graph convolutional network, and combines confidence weighting with K-means clustering to select 22 representative nodes for the Bayesian network. Under coupled risks such as malicious passenger behavior, smoke exhaust failure and delayed alarm, the high-casualty probability rises from a 6.58% baseline to 53.2%.

You’re all caught up