Better short than greedy: Interpretable models through optimal rule boosting

Computer Science

• Objective Function 100%
• Predictive Model 100%
• Comprehensibility 100%
• Benchmark Problem 100%
• Predictive Power 100%
• Predictive Performance 100%
• Interpretability 100%
• Predictive Accuracy 100%
• Ensemble Method 100%
• Branch-and-Bound Algorithm 100%
• Order Gradient 100%
• Gradient Boosting 100%

Mathematics

• Linear Time 100%
• Wide Range 100%
• Objective Function 100%
• Data Point 100%
• Predictive Power 100%
• Predictive Performance 100%
• Predictive Accuracy 100%
• Predictive Model 100%
• Interpretability 100%
• Random Search 100%

Keyphrases

• Optimal Rule 100%
• Model Interpretation 100%
• Rule Ensemble 100%
• Popular 33%
• Order of Accuracy 33%
• Linear Time 33%
• Prediction Accuracy 33%
• Performance Prediction 33%
• Predictive Models 33%
• Predictive Power 33%
• Accurately Model 33%
• Pruning Strategy 33%
• Gradient Boosting 33%
• Benchmark Problems 33%
• Model Interpretability 33%
• Model Comprehensibility 33%
• Ensemble Methods 33%
• Ensemble Size 33%
• Rule Redundancy 33%
• Greedy Rule 33%
• Random Search 33%
• Second Order Gradients 33%
• Branch-and-bound Algorithm 33%