Fast attribute reduction algorithm of rough set based on discernibility matrix

When core searching algorithm introduced by Karno Bozi extended the reduction,it needed to circularly search all the remanent items in discernibility matrix based on the appearance times of candidate attributes,until the matrix became empty,this induced the exis-tence of redundant attributes in the result.The improved fast algorithm based on the discernibility matrix,it set up counters for different attributes.Theoretical analysis and instance results show that the algorithm,obtaining the more reductive result,requiring less computional effort than core searching algorithm,is a simple and effective attribute reduction algorithm.