Irredundant test for binary tables (Q1974747)

The author describes an algorithm designed for constructing all irredundant tests for an arbitrary table. The irredundant test is an incompressible set of features retaining all information concerning the division of a table into classes. As a rule, there are numerous such irredundant sets of features, and they are extremely difficult to construct. The algorithm described in the present paper is particularly efficient when the number of columns exceeds the number of rows.