Enhancing the Performance of YYC Algorithm Useful to Generate Irreducible Testors

Abstract

In pattern recognition, irreducible testors have been used for feature selection. A number of exhaustive algorithms that find irreducible testors have been reported in the literature. One of the latest and more efficient algorithms reported is YYC, an incremental algorithm that finds all the irreducible testors from a training matrix. Its efficiency relies on building a smaller number of feature combinations by finding compatible sets from the top of the matrix to the current row. Nevertheless, as the number of sets currently found grows, YYC execution becomes too slow. This work proposes two improvements of YYC algorithm, incorporated in a pre-processing phase; additionally, a parallel version is implemented. The paper presents some experimental results using synthetic and real data.