在覆盖粗糙集的模型下,结合覆盖约简的理论,提出相对约简的概念并讨论其约简性质,指出该相对约简算法能够保持覆盖粗糙集的隶属度不变性,通过实例说明相对约简与William所提出的绝对约简之间的区别。丰富了覆盖粗糙集的约简理论。
Based on the modle of covering rongh sets, combining with the theory of covering reduction,the relative reduction was proposed and its properties were disscussed. It was pointed out that the degree of membership could keep unchanged under the reduced space. The experiments results showed the difference between relative reduction and absolute reduction which was proposed by William, which enriched the covering reduction theory.