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

F-ladder Knowledge and F-ladder Mining-discovery

作　　者：郝秀梅[1] 李淑敏[1] 史开泉[2] 

机构地区：[1]山东财经大学数学与数量经济学院,济南250014 [2]山东大学数学学院,济南250100

出　　处：《计算机科学》2012年第12期198-203,共6页Computer Science

基　　金：山东省科技厅项目(2011RKB01220)资助

摘　　要：利用单向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.

关 键 词：单向S-粗集 F-阶梯知识 F-阶梯度 挖掘-发现定理 挖掘-发现准则 潜藏原理 应用 

分 类 号：O159[理学—数学] TP181[理学—基础数学]