Gaël Aglin

Orcid: 0000-0002-6760-4752

According to our database1, Gaël Aglin authored at least 8 papers between 2020 and 2024.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of five.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Interpretable Quantile Regression by Optimal Decision Trees.
Proceedings of the Advances in Intelligent Data Analysis XXII, 2024

Efficient Lookahead Decision Trees.
Proceedings of the Advances in Intelligent Data Analysis XXII, 2024

An Efficient Structured Perceptron for NP-Hard Combinatorial Optimization Problems.
Proceedings of the Integration of Constraint Programming, Artificial Intelligence, and Operations Research, 2024

2022
Optimal decision trees under constraints.
PhD thesis, 2022

Learning Optimal Decision Trees Under Memory Constraints.
Proceedings of the Machine Learning and Knowledge Discovery in Databases, 2022

2021
Assessing Optimal Forests of Decision Trees.
Proceedings of the 33rd IEEE International Conference on Tools with Artificial Intelligence, 2021

2020
PyDL8.5: a Library for Learning Optimal Decision Trees.
Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, 2020

Learning Optimal Decision Trees Using Caching Branch-and-Bound Search.
Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, 2020


  Loading...