Gaël Aglin

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

Collaborative distances:

• Dijkstra number of five.
• Erdős number of five.

2024

Interpretable Quantile Regression by Optimal Decision Trees.

Valentin Lemaire, Gaël Aglin, Siegfried Nijssen

Proceedings of the Advances in Intelligent Data Analysis XXII, 2024

Efficient Lookahead Decision Trees.

Harold Silvère Kiossou, Pierre Schaus, Siegfried Nijssen, Gaël Aglin

Proceedings of the Advances in Intelligent Data Analysis XXII, 2024

An Efficient Structured Perceptron for NP-Hard Combinatorial Optimization Problems.

Bastián Véjar, Gaël Aglin, Ali Irfan Mahmutogullari, Siegfried Nijssen, Pierre Schaus, Tias Guns

Proceedings of the Integration of Constraint Programming, Artificial Intelligence, and Operations Research, 2024

2022

Optimal decision trees under constraints.

Gaël Aglin

PhD thesis, 2022

Learning Optimal Decision Trees Under Memory Constraints.

Gaël Aglin, Siegfried Nijssen, Pierre Schaus

Proceedings of the Machine Learning and Knowledge Discovery in Databases, 2022

2021

Assessing Optimal Forests of Decision Trees.

Gaël Aglin, Siegfried Nijssen, Pierre Schaus

Proceedings of the 33rd IEEE International Conference on Tools with Artificial Intelligence, 2021

2020

PyDL8.5: a Library for Learning Optimal Decision Trees.

Gaël Aglin, Siegfried Nijssen, Pierre Schaus

Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, 2020

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

Gaël Aglin, Siegfried Nijssen, Pierre Schaus

Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, 2020