An Algorithm for Computing Minimum-Length Irreducible Testors

Abstract

In pattern recognition, the elimination of unnecessary and/or redundant attributes is known as feature selection. Irreducible testors have been used to perform this task. An objective of the Minimum Description Length Principle (MDL) applied to feature selection in pattern recognition and data mining is to select the minimum number of attributes in a data set. Consequently, the MDL principle leads us to consider the subset of irreducible testors of minimum length. Some algorithms that nd the whole set of irreducible testors have been reported in the literature. However, none of these algorithms was designed to generate only minimum-length irreducible testors. In this paper, we propose the rst algorithm speci cally designed to calculate all minimum-length irreducible testors from a training sample. The paper presents some experimental results obtained using synthetic and real data in which the performance of the proposed algorithm is contrasted with other state-of-the-art algorithms that were adapted to generate only irreducible testers of minimum length.