Dynamic Selection Best Model (DSBM) approach based on meta-learning

Ensemble learning methods such as bagging, boosting and stacking have emerged in recent decades as powerful machine learning techniques. They are based on the use of several learning models to improve prediction performance. However, they have certain drawbacks, particularly in terms of computational overhead, understanding, time execution and scalability. In this paper, we propose a new ensemble approach based on meta-learning that overcomes the limitations of existing ensemble methods. After training several classifiers, our method associates each instance with the most appropriate model, then builds a high-performance meta-model. Experimental validation results show that it outperforms the well-known bagging, boosting and stacking methods in terms of both accuracy and computation time. In addition, the results show that it is scalable.

Authors

Institutions

Publication Details

Published
2025-05-16
DOI
https://doi.org/10.1145/3757110.3757135
Primary Topic
Machine Learning and Data Classification
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Dynamic Selection Best Model (DSBM) approach based on meta-learning

Fodé Camara, Khardiata Diallo Mbaye
Machine Learning and Data Classification
article

Dynamic Selection Best Model (DSBM) approach based on meta-learning

Fodé Camara, Khardiata Diallo Mbaye
article en

Abstract

Ensemble learning methods such as bagging, boosting and stacking have emerged in recent decades as powerful machine learning techniques. They are based on the use of several learning models to improve prediction performance. However, they have certain drawbacks, particularly in terms of computational overhead, understanding, time execution and scalability. In this paper, we propose a new ensemble approach based on meta-learning that overcomes the limitations of existing ensemble methods. After training several classifiers, our method associates each instance with the most appropriate model, then builds a high-performance meta-model. Experimental validation results show that it outperforms the well-known bagging, boosting and stacking methods in terms of both accuracy and computation time. In addition, the results show that it is scalable.

Université Alioune Diop de Bambey (SN), Cheikh Anta Diop University (SN)
Openalex Percentile: Top 85%
Machine Learning and Data Classification
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.