Journal of Systems Engineering and Electronics ›› 2008, Vol. 19 ›› Issue (6): 1171-1177.

• SYSTEMS ENGINEERING • Previous Articles     Next Articles

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

Hao Xiumei1,3, Fu Haiyan1,2 & Shi Kaiquan1   

  1. 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
  • Online:2008-12-23 Published:2010-01-03

Abstract:

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.