An evolutionary algorithm with acceleration operator to generate a subset of typical testors

Abstract

This paper is focused on introducing a Hill-Climbing algorithm as a way to solve the problem of generating\ntypical testors – or non-reducible descriptors – from a training matrix. All the algorithms reported\nin the state-of-the-art have exponential complexity. However, there are problems for which there is no\nneed to generate the whole set of typical testors, but it suffices to find only a subset of them. For this reason,\nwe introduce a Hill-Climbing algorithm that incorporates an acceleration operation at the mutation\nstep, providing a more efficient exploration of the search space. The experiments have shown that, under\nthe same circumstances, the proposed algorithm performs better than other related algorithms reported\nso far.