S-粗集(singular rough sets)存在三种形式:单向S-粗集(one direction singular rough sets),单向S-粗集对偶(dualof one direction singular rough sets)和双向S-粗集(two direction singular rough sets)。S-粗集具有动态特性,遗传特性,记忆特性和隐藏特性。利用S-粗集,给出了f-隐藏知识,F-隐藏知识,隐藏度和隐藏-依赖度的概念,提出了关于隐藏知识的隐藏定理和隐藏-依赖定理,并给出应用。
By using two-directional S-rough sets, the concepts of （f, f）-interference generation and （f, f）- interference law generation of knowledge, F-interference generation and F-interference law generation of two-directional S-rough sets are proposed. Based on the concepts above, the relation theoreras between F-interference loss and F-interference degree, the relation theorems between F-interference loss law and F-interference degree law, the dis- cernibility theorems between F-interference and F-interference law are presented. At last, the recognition criterion of F-interference law and its application are given.
By using function one direction S-rough sets （function one direction singular rough sets）, this article presents the concepts of F-law, F-rough law, and the relation metric of rough law; by using these concepts, this article puts forward the theorem of F-law relation metric, two orders theorem of F-rough law relation metric, the attribute theorem of F-rough law band, the extremum theorem of F-rough law relation metric, the discovery principle of F-rough law and the application of F-rough law.
