6533b7d6fe1ef96bd1266f71

RESEARCH PRODUCT

A local complexity based combination method for decision forests trained with high-dimensional data

subject

description

Accurate machine learning with high-dimensional data is affected by phenomena known as the “curse” of dimensionality. One of the main strategies explored in the last decade to deal with this problem is the use of multi-classifier systems. Several of such approaches are inspired by the Random Subspace Method for the construction of decision forests. Furthermore, other studies rely on estimations of the individual classifiers' competence, to enhance the combination in the multi-classifier and improve the accuracy. We propose a competence estimate which is based on local complexity measurements, to perform a weighted average combination of the decision forest. Experimental results show how this idea significantly outperforms the standard non-weighted average combination and also the renowned Classifier Local Accuracy competence estimate, while consuming significantly less time.