计算机科学 ›› 2012, Vol. 39 ›› Issue (12): 204-207.

• 人工智能 • 上一篇    下一篇

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

郝秀梅 李淑敏 史开泉   

  1. (山东财经大学数学与数量经济学院 济南 250014) (山东大学数学学院 济南 250100)
  • 出版日期:2018-11-16 发布日期:2018-11-16

F-ladder Knowledge and F-ladder Mining-discovery

  • Online:2018-11-16 Published:2018-11-16

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

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

Abstract: 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 dependenccfilter 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 appli- canons 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 trough sets.

Key words: One direction trough sets, F-ladder knowledge, F-ladder degree, Mining-discovery theorem, Mining-discovery criterion, Hiding principle, Application

No related articles found!
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!