Simplification of Boolean-valued data by minimum covering

In this paper, a set covering problem is considered. The problem of concern is the simplification of data representation for large-scale Boolean-valued data structures by generating a minimum cover for one of the two data classes. The cover is based on a “neighborhood” concept which can be specified in terms of simple parameters. An optimal set of neighborhoods or a minimum cover is determined which corresponds to the search for an optimal solution for a data representation requiring the minimum number of parameters.