|CONSOLO ANTONIO||Cycle: XXXVI|
Section: Systems and Control
Advisor: AMALDI EDOARDO
Tutor: PIRODDI LUIGI
Major Research topic:
Sparse randomized decision trees
In machine learning decision trees are widely used techniques thanks to both their interpretability and good accuracy performance. A decision tree has a flowchart-like structure where each branch node represents a "test" on attributes and each leaf node represents a decision taken after computing all attributes. They can be used both for classification and regression tasks. Since designing optimal decision trees is NP-hard, classical methods are characterised by greedy approaches. Given the substantial progress in mixed-integer linear programming (MILP) and nonlinear programming, optimal decision trees have recently attracted renewed attention. In my project I’m interested in optimization methods for Sparse Randomized Decision Trees for both classification and regression tasks.
These cookies are not optional. They are needed for the website to function.
In order for us to improve the website's functionality and structure, based on how the website is used.
In order for our website to perform as well as possible during your visit. If you refuse these cookies, some functionality will disappear from the website.
By sharing your interests and behavior as you visit our site, you increase the chance of seeing personalized content and offers.