In several domains, such as in Machine Learning, there is a variety of algorithms that can be considered as candidates to solve particular problems. One of the most difficulty tasks in these domains is to predict when one algorithm is better than another to solve a given problem. Traditional approaches to predicting the performance of algorithms often involve costly trial-and-error procedures. Other approaches require expert knowledge, which is not always straightforward to acquire.
In the previous context, meta-learning approaches have arisen as effective solutions, able to automatically predict algorithms performance for a given problem. Thus, such approaches could support non-expert users in the algorithm selection task. There are different interpretations for the term “meta-learning”. In our work, we use “meta-learning” meaning the automatic process of generating knowledge that relates the performance of machine learning algorithms to the characteristics of the problem (i.e., characteristics of its datasets).
So far, in the literature, meta-learning had been used only for selecting/ranking supervised learning algorithms. Motivated by this, we extend the use of meta-learning approaches for clustering algorithms. We developed our case study in the context of clustering algorithms applied to cancer gene expression data generated by microarray.
There are several works that can be developed from our proposal by, for example, implementing other meta-learners for different categories of datasets, and by using other meta-learning approaches that have not yet been used in the algorithm selection problem. Recently, in the context of supervised learning, we analyzed the relevance of the complexity measures as meta-attributes.