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

Authors:

Abstract
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.

This publication has 2 references indexed in Scilit: