A New Algorithm for Attribute Reduction Based on Relative Distinguish Precision

摘要：

A new algorithm for rough set theory attribute reduction is proposed, which is based on knowledge quantity theory. Through the introduction of relative distinction precision to measure the significance of attribute, which can be used as heuristic information put forward a new kind of reduction method. The time complexity of this algorithm is only,O(|a|2|u|), an example shows that the method is effective and correct.

关键词： Rough set theory attribute reduction relative distinguish precision knowledge quantity

作者: Lv Yue-jin Wei Bi-peng Li Shu-yan

作者单位: College of Mathematics and Information Sciences Guangxi University Nanning, China

会议类型: 国际会议

会议名称: 2011 2nd International Conference on Data Storage and Data Engineering(DSDE 2011)(2011年第二届数据存储与数据工程国际会议)

会议地点: 西安

会议语种:英文

页码: 143-146

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