【摘要】 在粗糙集理论中对信息系统的属性集进行约简是一个重要的课题,属性核是所有约简的交集,从而现行的许多属性约简算法,都是以属性核为起点,利用启发式信息(如相对信息量,相对重要性等)逐步对属性核中添加相对最重要的属性,直到得到原信息系统的一个约简为止,论文提出了一种新的计算属性核的算法,该算法避免了传统算法中重复计算等价矩阵交运算次数多的缺点,降低了常规算法的时间复杂度。更多还原

【Abstract】 Concerning the rough set theory,to reduce the set of attributes in the information system is a significant subject. Since the attribute core is the intersection of all the reducts,many current reduction algorithm of the attributes originate from it,in which one has to make use of the heuristic information(the quantity of relative information,the relative significance) to add the more important attributes to the attribute core step by step until work out a reduct of the original information system.However,this paper puts forward a new method for working out the attribute core.This method successfully avoids the weakness of conventional algorithm which frequently makes operation of intersection between equivalence matrices and shortens the time complexity of algorithm by the conventional one.更多还原