atlas

Research map / Learning theory and algorithms / Prediction and decision losses

Compiling Bayesian Network Classifiers into Decision Graphs

AAAI 2019 · Learning theory and algorithms › Prediction and decision losses · approach: Optimal decision tree learning · 56 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
increase largest feature block size (emdec6g 27 to 30 features)BN-to-ODD compilation · emdec6gcompile time (s): 11 -> 2,487Hurt
increase largest feature block only slightly (emdec6g 30 to 33 features)BN-to-ODD compilation · emdec6gcompile time (s): 2,487 -> 5,308Hurt
use a balanced classification threshold instead of a heavily biased oneBN-to-ODD compilation · Bayesian network classifiersODD size and compile timeHurt
compile via block ordering and equivalence intervals instead of full decision treeBN-to-ODD compilation · Andes VKEODD size vs boundHelped

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy