Interpretable Two-level Boolean Rule Learning for Classification
As a contribution to interpretable machine learning research, we develop a novel optimization framework for learning accurate and sparse two-level Boolean rules. We consider rules in both conjunctive normal form (AND-of-ORs) and disjunctive normal form (OR-of-ANDs). A principled objective function is proposed to trade classification accuracy and interpretability, where we use Hamming loss to characterize accuracy and sparsity to characterize interpretability. We propose efficient procedures to optimize these objectives based on linear programming (LP) relaxation, block coordinate descent, and alternating minimization. Experiments show that our new algorithms provide very good tradeoffs between accuracy and interpretability.
Code (0)
등록된 구현이 없습니다.
Tasks
BIG-bench Machine LearningClassificationFormGeneral ClassificationInterpretable Machine LearningVocal Bursts Valence PredictionSimilar Papers 제목 키워드 기반
Interpretable Two-level Boolean Rule Learning for Classification
This paper proposes algorithms for learning two-level Boolean rules in Conjunctive Normal Form (CNF, i.e. AND-of-ORs) or Disjunctive Normal Form (DNF, i.e. OR-of-ANDs) as a type of human-interpretable classification mode…
ClassificationGeneral ClassificationVocal Bursts Valence PredictionInterpretable and Fair Boolean Rule Sets via Column Generation
This paper considers the learning of Boolean rules in disjunctive normal form (DNF, OR-of-ANDs, equivalent to decision rule sets) as an interpretable model for classification. An integer program is formulated to optimall…
ClassificationFairnessBoolean Decision Rules via Column Generation
This paper considers the learning of Boolean rules in either disjunctive normal form (DNF, OR-of-ANDs, equivalent to decision rule sets) or conjunctive normal form (CNF, AND-of-ORs) as an interpretable model for classifi…
General ClassificationLIBRE: Learning Interpretable Boolean Rule Ensembles
We present a novel method - LIBRE - to learn an interpretable classifier, which materializes as a set of Boolean rules. LIBRE uses an ensemble of bottom-up weak learners operating on a random subset of features, which al…
Fair Decision Rules for Binary Classification
In recent years, machine learning has begun automating decision making in fields as varied as college admissions, credit lending, and criminal sentencing. The socially sensitive nature of some of these applications toget…
Binary ClassificationClassificationDecision MakingFairness