Simplification of Boolean-valued data by minimum covering |
| |
Authors: | Jong C Wang Marlin H Mickle Ronald G Hoelzeman |
| |
Affiliation: | 1. University of Pittsburgh, Pittsburgh, Pennsylvania 15261 USA;1. Now with Center for Energy Systems, General Electric, Washington, D.C.USA |
| |
Abstract: | 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. |
| |
Keywords: | |
本文献已被 ScienceDirect 等数据库收录! |
|