By using the dynamic characteristic of one direction S-rough sets（one direction singular rough sets） and dual of one direction S-rough sets（dual of one direction singular rough sets）, the concepts of attribute dis...By using the dynamic characteristic of one direction S-rough sets（one direction singular rough sets） and dual of one direction S-rough sets（dual of one direction singular rough sets）, the concepts of attribute disturbance of knowledge, the attribute disturbance degree of knowledge, and the disturbance coefficient of knowledge are given. By employing these concepts, the cardinal order theorem of the attribute disturbance knowledge, the unit circle theorem of the attribute disturbance knowledge, and the discernible theorem of the attribute disturbance knowledge are presented.展开更多
By employing the knowledge（R-element equivalence class） in one direction S-rough sets and dual of one direction S-rough sets, the concept of knowledge law is given; the generation theorem of knowledge law, the excur...By employing the knowledge（R-element equivalence class） in one direction S-rough sets and dual of one direction S-rough sets, the concept of knowledge law is given; the generation theorem of knowledge law, the excursion theorem of knowledge law, and the attribute disturbance discernible theorem of knowledge law are proposed. Knowledge law is a new characteristic of S-rough sets.展开更多
By using the dual of one direction singular rough sets,the concepts of F-knowledge and its F-reduction were given;F-reduction theorem of F-knowledge and attribute supplement redundant principle of F-reduction are pres...By using the dual of one direction singular rough sets,the concepts of F-knowledge and its F-reduction were given;F-reduction theorem of F-knowledge and attribute supplement redundant principle of F-reduction are presented;the dual of one direction singular rough sets is one of the basic forms of singular rough sets;knowledge reduction is a new research direction on rough sets and rough system theory.展开更多
P-集合(packet sets)是把动态特性引入到有限普通集合X内,改进有限普通集合X得到的一个动态模型;在一定的条件下,P-集合被还原成有限普通集合X。P-集合由内P-集合XF珚(internal packet set XF珚)与外P-集合XF(outerpacket set XF)构成...P-集合(packet sets)是把动态特性引入到有限普通集合X内,改进有限普通集合X得到的一个动态模型;在一定的条件下,P-集合被还原成有限普通集合X。P-集合由内P-集合XF珚(internal packet set XF珚)与外P-集合XF(outerpacket set XF)构成的集合对;或者,(XF珚,XF)是P-集合。P-推理(packet reasoning)由内P-推理(internal packet rea-soning)与外P-推理(outer packet reasoning)共同构成。利用内P-集合与内P-推理,给出了内P-信息恢复概念与内P-信息恢复特征、内P-信息恢复的内P-推理生成与它的属性潜藏、内P-信息恢复的信息元补充定理、内P-信息恢复的依赖性定理,以及内P-推理信息恢复的属性潜藏定理与属性潜藏发现定理。利用这些理论结果,给出内P-推理信息恢复在信息系统中的应用。展开更多
P-集合(packet sets)是一个具有动态特征的、新的数学结构与数学模型;P-集合是由内P-集合XF珚(internal packet set XF珚)与外P-集合XF(outer packet set XF)构成的集合对;或者(XF珚,XF)是P-集合。P-集合是把动态特性引入有限普通集合X(...P-集合(packet sets)是一个具有动态特征的、新的数学结构与数学模型;P-集合是由内P-集合XF珚(internal packet set XF珚)与外P-集合XF(outer packet set XF)构成的集合对;或者(XF珚,XF)是P-集合。P-集合是把动态特性引入有限普通集合X(Cantor set X)内,改进有限普通集合X得到的。P-推理(packet reasoning)是由内P-推理(internal packet reasoning)与外P-推理(outer packet reasoning)共同构成的。利用P-集合、P-推理,研究风险投资亏损发现。给出规律、内P-规律、外P-规律、P-规律及其生成;给出规律属性定理、内P-规律、外P-规律的P-推理发现;介绍内P-推理在风险投资亏损估计中的应用。展开更多
基金Foundation item： Supported by the Nature Science Foundation of Shandong Province（Y2007H02）
文摘By using the dynamic characteristic of one direction S-rough sets（one direction singular rough sets） and dual of one direction S-rough sets（dual of one direction singular rough sets）, the concepts of attribute disturbance of knowledge, the attribute disturbance degree of knowledge, and the disturbance coefficient of knowledge are given. By employing these concepts, the cardinal order theorem of the attribute disturbance knowledge, the unit circle theorem of the attribute disturbance knowledge, and the discernible theorem of the attribute disturbance knowledge are presented.
基金Foundation item： Supported by the Nature Science Foundation of Shandong Province（Y2007H02）
文摘By employing the knowledge（R-element equivalence class） in one direction S-rough sets and dual of one direction S-rough sets, the concept of knowledge law is given; the generation theorem of knowledge law, the excursion theorem of knowledge law, and the attribute disturbance discernible theorem of knowledge law are proposed. Knowledge law is a new characteristic of S-rough sets.
基金Supported by the Nature Science Foundation of Henan Province（102300410153） Supported by the Natural Science Foundation of Shandong Province（Y2007H02）
文摘By using the dual of one direction singular rough sets,the concepts of F-knowledge and its F-reduction were given;F-reduction theorem of F-knowledge and attribute supplement redundant principle of F-reduction are presented;the dual of one direction singular rough sets is one of the basic forms of singular rough sets;knowledge reduction is a new research direction on rough sets and rough system theory.
文摘P-集合(packet sets)是一个具有动态特征的、新的数学结构与数学模型;P-集合是由内P-集合XF珚(internal packet set XF珚)与外P-集合XF(outer packet set XF)构成的集合对;或者(XF珚,XF)是P-集合。P-集合是把动态特性引入有限普通集合X(Cantor set X)内,改进有限普通集合X得到的。P-推理(packet reasoning)是由内P-推理(internal packet reasoning)与外P-推理(outer packet reasoning)共同构成的。利用P-集合、P-推理,研究风险投资亏损发现。给出规律、内P-规律、外P-规律、P-规律及其生成;给出规律属性定理、内P-规律、外P-规律的P-推理发现;介绍内P-推理在风险投资亏损估计中的应用。
