Skip to main content
Search

# Class Formula Compilation

1 related articles

Subscribe to updates
  1. Multi-class Bayesian network classifiers get compilable explanations: 492 of 554 benchmark problems solved, up from 166

    Explanations for multi-class Bayesian network classifiers were previously limited by a binary-class assumption and by compilation into ordered binary decision diagrams. A new algorithm arranges features on a feature tree embedded in a jointree and stops enumerating once a partial feature instantiation already decides the class, emitting an OR-decomposable NNF circuit on which complete and general reasons can be computed in linear time. On 554 benchmark problems it completed 492, against 166 for the prior algorithm.

You’re all caught up