F-阶梯知识与F-阶梯挖掘-发现

F-ladder Knowledge and F-ladder Mining-discovery

利用单向S-粗集(one direction singular rough sets)与它的动态特性,给出F-阶梯知识、F-阶梯度的概念。利用这些概念,提出F-阶梯知识分辩定理、最小F-阶梯知识挖掘-发现定理、最大F-阶梯知识挖掘-发现定理、知识发现依赖-筛选定理与F-阶梯知识内潜藏原理,给出F-阶梯知识挖掘-发现准则及应用。这些结果是单向S-粗集的新特性与单向S-粗集的动态特性的新应用。

By employing one direction S-rough sets（one direction singular rough sets） and its dynamic characteristic,this paper presented the concepts of F-ladder knowledge and F-ladder degree.Using theses concepts,the discernibility theorem of F-ladder knowledge,the mining-discovery theorem of minimum F-ladder knowledge,the mining-discovery theorem of maximum F-ladder knowledge and the dependence-filter theorem of knowledge discovery ere proposed,and the interior hiding principle of F-ladder knowledge,the mining-discovery criterion of F-ladder knowledge and its applications were given.The results given in this paper show the new characteristics of one direction S-rough sets and the new applications of the dynamic characteristic of one direction S-rough sets.