Quick Attribute Reduction Based on Rough Boundary Region

Attribute reduction is one of the core research content of Rough set.Most of the existing greedy reduction algorithm is based on positive region to find out an algebraic reduct.In fact,for an inconsistency decision table,algebra reduct changes the original Pawlak topology and expands the uncertainty degree of decision table.Therefore,in this paper,a novel reduction modal based on rough boundary region was introduced,which can keep the original Pawlak topology.Based on this model,an efficient algorithm for attribute reduction based on rough boundary region was proposed.Theoretical analysis and experimental results show that the algorithm of this paper is effective and feasible.