Novel Heuristic Algorithm for Knowledge Reduction

Knowledge reduction is one of the most important problems in rough set theory.In this paper,simple discernibility function is defined by discernibility matrice,and then two kinds of operations and relevant concepts such as minimal coverage are defined,with which the problem of finding reduction for DS is turned into another problem of finding minimal coverage of simple discernibility function;significance of attributes in decision table is defined for minimal reduction based on simple discernibility function,which is used as heuristic information to design a novel knowledge reduction algorithm with relevant theory of minimal coverage.The presented algorithm,named as SDFAR,is proved to be complete.This paper also gives the algorithm's complexity analysis and experimental analysis,proving its completeness.The proposed algorithm is relatively effective for finding minimal reduct.