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 propert...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.展开更多
Function one direction S-rough sets have dynamic characteristics and law characteristics. By using the function one direction S-rough sets, this article presents the concepts of the f-hiding law, F-hiding law, f-hidin...Function one direction S-rough sets have dynamic characteristics and law characteristics. By using the function one direction S-rough sets, this article presents the concepts of the f-hiding law, F-hiding law, f-hiding law dependence and F-hiding law dependence. Based on the concepts above, this article proposes the hidingdependence theorem of f-hiding laws, the hiding-dependence theorem of F-hiding laws, the hiding-dependence separation theorem, the hiding dependence-discovery principle of unknown laws. Finally, the application of the hiding dependence of hiding laws in the discovery of system laws is given.展开更多
基金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.
基金supported partly by the Natural Science Foundation of Shandong Province(Y2004A04)Elementaryand Advanced Technology Foundation of Henan Province(082300410040)
文摘Function one direction S-rough sets have dynamic characteristics and law characteristics. By using the function one direction S-rough sets, this article presents the concepts of the f-hiding law, F-hiding law, f-hiding law dependence and F-hiding law dependence. Based on the concepts above, this article proposes the hidingdependence theorem of f-hiding laws, the hiding-dependence theorem of F-hiding laws, the hiding-dependence separation theorem, the hiding dependence-discovery principle of unknown laws. Finally, the application of the hiding dependence of hiding laws in the discovery of system laws is given.
