"Learning Optimal Decision Trees Using Caching Branch-and-Bound Search."

Gaël Aglin, Siegfried Nijssen, Pierre Schaus (2020)

> Home

Details and statistics

DOI: 10.1609/AAAI.V34I04.5711

access: open

type: Conference or Workshop Paper

metadata version: 2023-09-04

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - conf/aaai/AglinNS20
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/aaai/AglinNS20
Gaël Aglin, Siegfried Nijssen, Pierre Schaus:
Learning Optimal Decision Trees Using Caching Branch-and-Bound Search. AAAI 2020: 3146-3153

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.