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
Published in:
Electronics Letters
(Volume:43
,
Issue:
10
)
Date of Publication: May 10 2007