We are currently experiencing intermittent issues impacting performance. We apologize for the inconvenience.
By Topic

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $31
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Xiumei, Hao ; School of Mathematics and System Science, Shandong Univ., Jinan 250100, P. R. China; Dept. of Statistics and Mathematics, Shandong Finance Inst., Jinan 250014, P. R. China ; Haiyan, Fu ; Kaiquan, Shi

Singular rough sets (S-rough sets) have three classes of forms: one-directional S-rough sets, dual of one-directional 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.

Published in:

Systems Engineering and Electronics, Journal of  (Volume:19 ,  Issue: 6 )