A modified heuristic algorithm of attribute reduction in rough set

As a useful tool for data mining,the rough set theory is widely used in the description of the correlation between attributes of relational database,the reduction of the attribute set,the counting of an attribute importance compared to other attribute importance,the discovery of rules,and so on.This paper discusses the attribute reduction in rough set theory.First,on the basis of analyzing the rough set theory,a detailed description of attribute reduction algorithm based on the discernible matrix is given.Second,as the traditional algorithm has relatively poor efficiency in both time and space when obtaining attribute reduction,the relationship degree,which describes the contribution of one condition attributes to decision attribute,is introduced into rough set to value the importance of attribute.And then a modified algorithm is given by using the relationship degree as heuristic information,Theory analysis and the experimental results show this algorithm costs less time and reduces the number of condition attributes than other algorithms.It establishes a method by which rough set theory is widely used in concrete practice.