S-粗集与F^--隐藏知识发现  

S-rough sets and F-hiding knowledge discovery

作　　者：郝秀梅[1] 付海艳[1] 史开泉[1] 

机构地区：[1]山东大学数学与系统科学学院

出　　处：《系统工程与电子技术》2008年第4期644-648,共5页Systems Engineering and Electronics

基　　金：国家自然科学基金(60364001);山东省自然科学基金(Y2007H02);福建省自然科学基金(Z0511049)资助课题

摘　　要：S-粗集具有三类形式:单向S-粗集,双向S-粗集,单向S-粗集对偶。S-粗集具有动态特性,遗传特性,记忆特性。利用单向S-粗集对偶与它的隐藏特性,本文给出f-隐藏知识,F-隐藏知识,隐藏度,隐藏依赖的概念,提出隐藏知识的隐藏定理,隐藏知识的隐藏依赖定理,给出F-隐藏与F-隐藏依赖在系统状态识别中的应用。Singular rough sets （S-rough sets）have three forms： one direction S-rough sets, dual of one direction S-rough sets and two direction S-rough sets. Dynamic, hereditary, mnemonic properties are the basic characteristics of S-rough sets. By using dual of one direction S-rough sets and its hiding characteristics, the concepts of -hiding knowledge, F^--hiding knowledge, hiding degree and hiding dependence are given. Then hiding theorem and hiding dependence theorem of hiding knowledge are proposed. Finally, an application of F^--hiding and F^--hiding dependence to system state recognition is discussed.

关 键 词：单向S-粗集对偶 f^--隐藏知识 隐藏度 隐藏依赖度 隐藏定理 隐藏依赖定理 应用 

分 类 号：O159[理学—数学] TP181[理学—基础数学]