基于0-1分辨矩阵的启发式属性约简

Heuristic attribute reduction based on 0-1 discernibility matrix

提出属性0-1分辨矩阵概念,分析其有关特性,将属性约简问题转化为0-1矩阵覆盖问题,并通过理论证明0-1矩阵覆盖问题与属性约简的关系。通过定义属性0-1矩阵覆盖重要度给出一种启发式属性约简方法,分析其时间复杂度,并通过实例说明该方法的有效性。

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.