Efficient rough-set-based attribute reduction algorithm with nearest neighbour searching

摘要

A fast nearest neighbour searching method with gradually shrinking search space is proposed to reduce the computing complexity of indiscernibility relation in the rough-set-based attribute reduction algorithm. Experimental results show that the proposed algorithm computed attribute reduction more efficiently