论文信息 - Efficient rough-set-based attribute reduction algorithm with nearest neighbour searching

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

[1] XIAOHUA Hu,et al. LEARNING IN RELATIONAL DATABASES: A ROUGH SET APPROACH , 1995, Comput. Intell..

[2] Liu Shao,et al. Research on Efficient Algorithms for Rough Set Methods , 2003 .

[3] Lixiang Shen,et al. Fault diagnosis based on Rough Set Theory , 2003 .

[4] Jerzy W. Grzymala-Busse,et al. Rough Sets , 1995, Commun. ACM.

[5] Jiye Liang,et al. The Algorithm on Knowledge Reduction in Incomplete Information Systems , 2002, Int. J. Uncertain. Fuzziness Knowl. Based Syst..