Reducing Meta-Level Data in Stacking Ensembles for Classification

Stacking as an ensemble framework relies on meta-learning for combining the outputs of multiple base classifiers. What exactly the outputs represent and how they are used for meta-learning is an important aspect of stacking. Commonly, the prediction probabilities produced by the base classifiers at the class level are used for training the meta-classifier. The dimensionality of this meta-level data is, therefore, not negligible. Reducing it would result in the need for a less complex meta-classifier, and would thereby simplify the process of meta-learning. This paper presents a straightforward approach for aggregating the prediction probabilities of the base classifiers. By calculating the mean and standard deviation at the class level, a substantial reduction in the dimensionality of the meta-level data is achieved. The experimental analysis, conducted on multiple diverse datasets, suggests that the aggregation preserves sufficient information for meta-learning since better or highly competitive performance was attained with respect to the common stacking ensemble framework (utilising the full meta-level data).

Authors

Institutions

Publication Details

Published
2024-10-16
DOI
https://doi.org/10.1109/sst61991.2024.10755194
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

Reducing Meta-Level Data in Stacking Ensembles for Classification

Mario Dudjak, Dražen Bajer, Bruno Zorić
Machine Learning and Data Classification
article

Reducing Meta-Level Data in Stacking Ensembles for Classification

Mario Dudjak, Dražen Bajer, Bruno Zorić
article en

Abstract

Stacking as an ensemble framework relies on meta-learning for combining the outputs of multiple base classifiers. What exactly the outputs represent and how they are used for meta-learning is an important aspect of stacking. Commonly, the prediction probabilities produced by the base classifiers at the class level are used for training the meta-classifier. The dimensionality of this meta-level data is, therefore, not negligible. Reducing it would result in the need for a less complex meta-classifier, and would thereby simplify the process of meta-learning. This paper presents a straightforward approach for aggregating the prediction probabilities of the base classifiers. By calculating the mean and standard deviation at the class level, a substantial reduction in the dimensionality of the meta-level data is achieved. The experimental analysis, conducted on multiple diverse datasets, suggests that the aggregation preserves sufficient information for meta-learning since better or highly competitive performance was attained with respect to the common stacking ensemble framework (utilising the full meta-level data).

University of Osijek (HR)
Openalex Percentile: Top 81%
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.