Joint leaf-refinement and ensemble pruning through L1 regularization
| dc.contributor.author | Buschjäger, Sebastian | |
| dc.contributor.author | Morik, Katharina | |
| dc.date.accessioned | 2025-02-24T10:44:35Z | |
| dc.date.available | 2025-02-24T10:44:35Z | |
| dc.date.issued | 2023-03-15 | |
| dc.description.abstract | Ensembles are among the state-of-the-art in many machine learning applications. With the ongoing integration of ML models into everyday life, e.g., in the form of the Internet of Things, the deployment and continuous application of models become more and more an important issue. Therefore, small models that offer good predictive performance and use small amounts of memory are required. Ensemble pruning is a standard technique for removing unnecessary classifiers from a large ensemble that reduces the overall resource consumption and sometimes improves the performance of the original ensemble. Similarly, leaf-refinement is a technique that improves the performance of a tree ensemble by jointly re-learning the probability estimates in the leaf nodes of the trees, thereby allowing for smaller ensembles while preserving their predictive performance. In this paper, we develop a new method that combines both approaches into a single algorithm. To do so, we introduce L1 regularization into the leaf-refinement objective, which allows us to jointly prune and refine trees at the same time. In an extensive experimental evaluation, we show that our approach not only offers statistically significantly better performance than the state-of-the-art but also offers a better accuracy-memory trade-off. We conclude our experimental evaluation with a case study showing the effectiveness of our method in a real-world setting. | en |
| dc.identifier.uri | http://hdl.handle.net/2003/43491 | |
| dc.identifier.uri | http://dx.doi.org/10.17877/DE290R-25324 | |
| dc.language.iso | en | |
| dc.relation.ispartofseries | Data mining and knowledge discovery : DMKD; 37(3) | |
| dc.rights.uri | https://creativecommons.org/licenses/by/4.0/ | |
| dc.subject | Ensemble | en |
| dc.subject | Ensemble pruning | en |
| dc.subject | Random Forest | en |
| dc.subject | Memory management | en |
| dc.subject.ddc | 004 | |
| dc.subject.rswk | Random Forest | de |
| dc.subject.rswk | Speicherverwaltung | de |
| dc.title | Joint leaf-refinement and ensemble pruning through L1 regularization | en |
| dc.type | Text | |
| dc.type.publicationtype | Article | |
| dcterms.accessRights | open access | |
| eldorado.secondarypublication | true | |
| eldorado.secondarypublication.primarycitation | Buschjäger, S. and Morik, K. (2023) ‘Joint leaf-refinement and ensemble pruning through $$L_1$$ regularization’, Data mining and knowledge discovery : DMKD, 37(3), pp. 1230–1261. Available at: https://doi.org/10.1007/s10618-023-00921-z | |
| eldorado.secondarypublication.primaryidentifier | https://doi.org/10.1007/s10618-023-00921-z |