Searching Algorithm for Attribute Reduction Based on Power Graph

Rough set theory is a new mathematical tool to deal with imprecise,incomplete and inconsistent data.Attribute reduction is one of important issues in rough sets.Most existing algorithms are studied under both algebra and information representations.As problem solving under different knowledge representations corresponding to different difficulties,the new knowledge representation,called power graph,is presented in this paper.Searching algorithms based on power graph are also proposed,which can translate computing problem of attribute reduction into searching problem in power graph.The algorithms will provide a new method in attribute reduction and the efficiency of the method has been proved in theoretical analysis.