CAJ | 학술논문

求核是粗糙集中一个重要的研究内容之一.本文对杨明的基于差别矩阵求核方法进行研究,实例表明其方法还存在一些不完善.为了能够进一步提高求核效率,对差别矩阵进行改进,提出一种简化差别矩阵的定义,并给出求核方法,同时证明了由该方法获得的核与正区域的核是等价的,由此设计求核算法,其时间复杂度为max{O(|C||U|),O(|C||U/C||U′1|)},空间复杂度为O(|C||U/C||U′1|).实验表明,该算法是有效的、高效的,且能适合大数据集的处理.
구핵시조조집중일개중요적연구내용지일.본문대양명적기우차별구진구핵방법진행연구,실례표명기방법환존재일사불완선.위료능구진일보제고구핵효솔,대차별구진진행개진,제출일충간화차별구진적정의,병급출구핵방법,동시증명료유해방법획득적핵여정구역적핵시등개적,유차설계구핵산법,기시간복잡도위max{O(|C||U|),O(|C||U/C||U′1|)},공간복잡도위O(|C||U/C||U′1|).실험표명,해산법시유효적、고효적,차능괄합대수거집적처리.
Computing the core is an important research issue in the rough set. The method for computing the core based on improved discernibility matrix, which was presented by Yang Ming, is studied. The example shows that the method is still imperfect in some aspects. In order to improve the efficiency of computing the core, the definition of a simplification discernibility matrix and the method of computing the core are provided. It is proved that the core acquired from the method is equivalent to the core based on the positive region. Based on this,a computing core algorithm is designed, and its time complexity is max {O(|C||U|),O(|C||U/C||U′1|)},and its space complexity is O(|C||U/C||U′1|). The experimental results show that the algorithm is not only effective and efficient, but also suitable for processing huge data efficiently.