Affiliations: [a] Department of Computer Science, University of Sao Paulo, Sao Carlos, Brazil | [b] Department of Electrical and Computer Engineering, University of Texas, Austin, ST, USA
Correspondence:
[*]
Corresponding author: Luiz F.S. Coletta, Department of Computer Science, University of Sao Paulo (USP) at Sao Carlos, Brazil. E-mail: [email protected]
Abstract: We investigate how to make a simpler version of an existing algorithm, named C^3E, from Consensus between Classification and Clustering Ensembles, more user-friendly by automatically tuning its main parameters with the use of metaheuristics.
In particular, C^{3}E based on a Squared Loss function, C^{3}E-SL, assumes an optimization procedure that takes as input class membership estimates from existing classifiers, as well as a similarity matrix from a cluster ensemble operating solely on the new target data, to provide a consolidated classification of the target data.
To do so, two parameters have to be defined a priori, namely: the relative importance of classifier and cluster ensembles and the number of iterations of the algorithm. In some practical applications, these parameters can be optimized via time consuming grid search approaches based on cross-validation procedures.
This paper shows that seven metaheuristics for parameter optimization yield classifiers as accurate as those obtained from grid search, but taking half the running time.
More precisely, and by assuming a trade-off between user-friendliness and accuracy, experiments performed on twenty real-world datasets suggest that CMA-ES, DE, and SaDE are the best alternatives to optimize the C^{3}E-SL parameters.
