ליאור רוקח

אקדמי בכיר

Collective-agreement-based pruning of ensembles

Ensemble methods combine several individual pattern classifiers in order to achieve better classification. The challenge is to choose the minimal number of classifiers that achieve the best performance. An ensemble that contains too many members might incur large storage requirements and even reduce the classification performance. The goal of ensemble pruning is to identify a subset of ensemble members that performs at least as good as the original ensemble and discard any other members. In this paper, we introduce the Collective-Agreement-based Pruning (CAP) method. Rather than ranking individual members, CAP ranks subsets by considering the individual predictive ability of each member along with the degree of redundancy among them. Subsets whose members highly agree with the class while having low inter-agreement are preferred.

שפת פרסום אנגלית
דפים 1015-1026
כתב עת Computational Statistics and Data Analysis
כרך 53
נושא מספר 4
סטטוס פרסום פורסם - 15.02.2009

ASJC Scopus subject areas

Statistics and Probability
Computational Theory and Mathematics
Computational Mathematics
Applied Mathematics
גישה למסמך
10.1016/j.csda.2008.12.001
קבצים וקישורים אחרים
Link to publication in Scopus