首页> 中文期刊> 《电子科技学刊:英文版》 >Improved Rough Set Algorithms for Optimal Attribute Reduct

Improved Rough Set Algorithms for Optimal Attribute Reduct

         

摘要

cqvip:Feature selection(FS) aims to determine a minimal feature(attribute) subset from a problem domain while retaining a suitably high accuracy in representing the original features. Rough set theory(RST) has been used as such a tool with much success. RST enables the discovery of data dependencies and the reduction of the number of attributes contained in a dataset using the data alone,requiring no additional information. This paper describes the fundamental ideas behind RST-based approaches,reviews related FS methods built on these ideas,and analyses more frequently used RST-based traditional FS algorithms such as Quickreduct algorithm,entropy based reduct algorithm,and relative reduct algorithm. It is found that some of the drawbacks in the existing algorithms and our proposed improved algorithms can overcome these drawbacks. The experimental analyses have been carried out in order to achieve the efficiency of the proposed algorithms.

著录项

获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号