An Binary Discernibility Matrix Attribute Reduction Algorithm on Attribute Importance Heuristic Message

摘要：

A binary discernibility matrix attribute reduction algorithm is introduced in this paper, which takes the importance of attributes as the heuristic message. This method solves the problem of the attribute selection when the frequencies of attributes are equal. The result shows that this method can give out simple but effective method of attribute reduction.

关键词： binary discernibility matrix attribute reduction rough set attribute importance

作者: Ying He Dan He

作者单位: Modern Education Technology Center, NanchangHangkong UniversityNanchang Hangkong UniversityNanchang, Information Center, Nanchang Hangkong University Nanchang Hangkong University Nanchang, China

会议类型: 国际会议

会议名称: 2011 International Conference on Information System and Computational Intelligence(2011 IEEE信息系统与计算智能国际会议 ICISCI 2011)

会议地点: 哈尔滨

会议语种:英文

页码: 228-230

在线出版日期: 2011-01-18（万方平台首次上网日期，不代表论文的发表时间）