Heuristic attribute reduction based on 0-1 discernibility matrix

A 0-1 discernibility matrix associated with attribute was proposed, and the characteristic of 0-1 matrix was investigated. The problem of constructing reduct was converted to the matrix cover problem. The relationship between attribute reduction and matrix covering was investigated theoretically. A heuristic reduction based on 0-1 matrix was presented and the complexity of the algorithm was analyzed. An example was presented to illustrate the algorithm and its validity.