S-rough sets and the discovery of F-hiding knowledge  

作　　者：Hao Xiumei Fu Haiyan Shi Kaiquan 

机构地区：[1]School of Mathematics and System Science, Shandong Univ., Jinan 250100, P. R. China [2]Dept. of Computer Science, Hainan Normal Univ., Haikou 571158, P. R. China [3]Dept. of Statistics and Mathematics, Shandong Finance Inst., Jinan 250014, P. R. China

出　　处：《Journal of Systems Engineering and Electronics》2008年第6期1171-1177,共7页系统工程与电子技术（英文版）

基　　金：supported by the National Natural Science Foundation of China (60364001,70461001);the Hainan Provincial Natural Science Foundation of China (807054);Hainan Provincial Education Office Foundation (HJ 2008-56)

摘　　要：Singular rough sets （S-rough sets） have three classes of forms： one-directional S-rough sets, dual of onedirectional S-rough sets, and two-directional S-rough sets. Dynamic, hereditary, mnemonic, and hiding properties are the basic characteristics of S-rough sets. By using the S-rough sets, the concepts of f-hiding knowledge, F-hiding knowledge, hiding degree, and hiding dependence degree are given. Then, both the hiding theorem and the hiding dependence theorem of hiding knowledge are proposed. Finally, an application of hiding knowledge is discussed.Singular rough sets （S-rough sets） have three classes of forms： one-directional S-rough sets, dual of onedirectional S-rough sets, and two-directional S-rough sets. Dynamic, hereditary, mnemonic, and hiding properties are the basic characteristics of S-rough sets. By using the S-rough sets, the concepts of f-hiding knowledge, F-hiding knowledge, hiding degree, and hiding dependence degree are given. Then, both the hiding theorem and the hiding dependence theorem of hiding knowledge are proposed. Finally, an application of hiding knowledge is discussed.

关 键 词：one-direction S-rough sets f-hiding knowledge hiding degree hiding dependence degree hiding theorem hiding dependence theorem application 

分 类 号：O24[理学—计算数学]