To cite this paper use one of the standards below:
The Algorithm Selection Problem (ASP) recommends the most appropriate algorithm for a particular instance. The EMODT-ASP framework, based on decision trees and a multiobjective approach, was originally proposed for ASP, with a focus on interpretability. We extended this framework to binary classification, adapting the evaluation function to use AUC, incorporating support for categorical features, and limiting the depth of trees to 7 levels to ensure interpretability. We evaluated our approach in 26 binary bases, obtaining a mean AUC of 0.792. A sensitivity study revealed that the original configuration of the parameters is robust and that shallow trees can be overfitted with excessive generations, and this effect is mitigated by higher minimum thresholds of instances per leaf. To improve generalization, we suggest automatic feature creation and cross-validation during training. We also want to extend our approach to multiclass and regression problems.
With nearly 200,000 papers published, Galoá empowers scholars to share and discover cutting-edge research through our streamlined and accessible academic publishing platform.
Learn more about our products:
This proceedings is identified by a DOI , for use in citations or bibliographic references. Attention: this is not a DOI for the paper and as such cannot be used in Lattes to identify a particular work.
Check the link "How to cite" in the paper's page, to see how to properly cite the paper