Nested k-DNFs, defined by prefixes of rows of a k-by-k literal matrix, form a new family of interpretable boolean classifiers whose empirical accuracy matches depth-k decision trees.
The query complexity of certification
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
cs.AI 1years
2025 1verdicts
CONDITIONAL 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
Interpretable DNFs
Nested k-DNFs, defined by prefixes of rows of a k-by-k literal matrix, form a new family of interpretable boolean classifiers whose empirical accuracy matches depth-k decision trees.