Ricerc@Sapienza

Embedding spaces are one of the mainstream approaches when dealing with structured data. Granular Computing, in the last decade, emerged as a powerful paradigm for the automatic synthesis of embedding spaces that, at the same time, yield an interpretable model on the top of meaningful entities known as information granules. Usually, in these contexts, one aims at finding the smallest set of information granules in order to boost the model interpretability while keeping satisfactory performances. In this paper, we add a third objective, namely the structural complexity of the resulting model and we exploit three biology-related case studies related to metabolic networks and protein networks in order to investigate the link between classification performances, embedding space dimensionality and structural complexity of the resulting model.