2019
DOI: 10.1609/aaai.v33i01.33017966
|View full text |Cite
|
Sign up to set email alerts
|

Compiling Bayesian Network Classifiers into Decision Graphs

Abstract: We propose an algorithm for compiling Bayesian network classifiers into decision graphs that mimic the input and output behavior of the classifiers. In particular, we compile Bayesian network classifiers into ordered decision graphs, which are tractable and can be exponentially smaller in size than decision trees. This tractability facilitates reasoning about the behavior of Bayesian network classifiers, including the explanation of decisions they make. Our compilation algorithm comes with guarantees on the ti… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

1
82
0
1

Year Published

2020
2020
2021
2021

Publication Types

Select...
5
1
1

Relationship

1
6

Authors

Journals

citations
Cited by 57 publications
(84 citation statements)
references
References 9 publications
1
82
0
1
Order By: Relevance
“…Past work on computing explanations has mostly addressed local (or instance-dependent) explanations [15,16,38,51,69,70,75,76]. Exceptions include for example approaches that distill ML models, e.g.…”
Section: Introductionmentioning
confidence: 99%
See 2 more Smart Citations
“…Past work on computing explanations has mostly addressed local (or instance-dependent) explanations [15,16,38,51,69,70,75,76]. Exceptions include for example approaches that distill ML models, e.g.…”
Section: Introductionmentioning
confidence: 99%
“…In contrast, local (or global) model-based explanations are referred to as rigorous, since these offer the strongest formal guarantees with respect to the underlying ML model. Concrete examples of such rigorous approaches include [15,16,35,[38][39][40][41]43,52,64,[75][76][77].…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…Hence, the proposal in [9] amounted to compiling a Naive Bayes classifier into a tractable NNF circuit that precisely captures its input-output behavior. This compilation algorithm was recently extended to Bayesian network classifiers with tree structures [82] and later to Bayesian network classifiers with arbitrary structures [83]. 17 Certain classes of neural networks can also be compiled into tractable circuits, which include SDD circuits as shown in [15,80,84].…”
Section: Logic For Meta Reasoningmentioning
confidence: 99%
“…A more descriptive term for the underlying probability model would be the "independent feature model" [21]. Bayesian has shown as an accurate model for various problem [22] [23]. Naïve Bayes was used by [24] in mapping out the potentially poor family in Indonesia to planning the right method in preventing such occurrence towards the family.…”
Section: Related Workmentioning
confidence: 99%