Rule generation for classification: scalability, interpretability, and fairness
From MaRDI portal
Cites work
- A Bayesian framework for learning rule sets for interpretable classification
- A decision-theoretic generalization of on-line learning and an application to boosting
- A multicommodity network-flow problem with side constraints on paths solved by column generation
- A unified approach to mixed-integer optimization problems with logical constraints
- Accuracy and fairness trade-offs in machine learning: a stochastic multi-objective approach
- An improved branch-and-bound method for maximum monomial agreement
- An improved column-generation-based matheuristic for learning classification trees
- Binarized support vector machines
- bsnsing: A Decision Tree Induction Method Based on Recursive Optimal Boolean Rule Composition
- Column generation based heuristic for learning classification trees
- Fairness through awareness
- scientific article; zbMATH DE number 7625179 (Why is no real title available?)
- scientific article; zbMATH DE number 7064055 (Why is no real title available?)
- Learning Boolean formulas
- Linear programming boosting via column generation
- Mathematical optimization in classification and regression trees
- Multi-class AdaBoost
- On the difficulty of approximately maximizing agreements.
- Optimal classification trees
- Optimal decision trees for categorical data via integer programming
- Optimization problems for machine learning: a survey
- Separate-and-conquer rule learning
- Sparsity in optimal randomized classification trees
- The Elements of Statistical Learning
This page was built for publication: Rule generation for classification: scalability, interpretability, and fairness
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6891390)
