ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 2101.08380
  4. Cited By
Better Short than Greedy: Interpretable Models through Optimal Rule
  Boosting

Better Short than Greedy: Interpretable Models through Optimal Rule Boosting

21 January 2021
Mario Boley
Simon Teshuva
P. L. Bodic
Geoffrey I. Webb
ArXivPDFHTML

Papers citing "Better Short than Greedy: Interpretable Models through Optimal Rule Boosting"

2 / 2 papers shown
Title
Robust subgroup discovery
Robust subgroup discovery
Hugo Manuel Proença
Peter Grünwald
Thomas Bäck
M. Leeuwen
23
11
0
25 Mar 2021
Learning Certifiably Optimal Rule Lists for Categorical Data
Learning Certifiably Optimal Rule Lists for Categorical Data
E. Angelino
Nicholas Larus-Stone
Daniel Alabi
Margo Seltzer
Cynthia Rudin
62
195
0
06 Apr 2017
1