A Efficiency Complete Algorithm for Attribute Reduction
A complete algorithm for attribute reduction in rough set theory based on discernibility matrix was introduced. This algorithm was composed of algorithm1 and algorithm2.Algorithm1 is to select those important condition attributes based on attribute frequency function in every iteration. Algorithm2 removes redundancy and incompatibility attributes in R found out by algorithm1.The time complexity of the algorithms in the worst case was analyzed and the proof of its completeness was given. Algorithm1 and algorithm2 guarantee that the reduction is probable a smallest or smaller one.
rough set discernibility matriz optimal reduction attribute significance complete algorithm
Jiang Yu Du Bin
College of Software Engineering Chengdu University of Information Technology Chengdu, China
国际会议
北京
英文
2325-2327
2009-08-08（万方平台首次上网日期，不代表论文的发表时间）