首页 | 本学科首页   官方微博 | 高级检索  
     检索      

基于单向S-粗集的知识堆垒与知识垛识别
引用本文:张凌,邱育锋,任雪芳.基于单向S-粗集的知识堆垒与知识垛识别[J].山东大学学报(理学版),2008,43(10):12-17.
作者姓名:张凌  邱育锋  任雪芳
作者单位:龙岩学院数学与计算机科学学院,福建,龙岩,364000山;东大学数学与系统科学学院,山东,济南,250100
基金项目:山东省自然科学基金,福建省教育厅A类科技项目资助项目,福建省资助省属高校项目
摘    要:利用单向S-粗集,给出知识堆垒及它生成的知识垛的概念,知识垛具有动态特性,给出粗知识垛的生成,提出粗知识垛生成原理及还原定理,提出粗知识垛分辨尺度及识别准则与识别定理,并给出应用。

关 键 词:单向S-粗集  知识堆垒  知识垛  粗知识垛  粗知识垛识别

One direction S-rough sets-based knowledge addition and knowledge battlement recognition
ZHANG Ling,QIU Yu-feng,REN Xue-fang.One direction S-rough sets-based knowledge addition and knowledge battlement recognition[J].Journal of Shandong University,2008,43(10):12-17.
Authors:ZHANG Ling  QIU Yu-feng  REN Xue-fang
Institution:1. School of Mathematics and Computer Science, Longyan University, Longyan 364000, Fujian, China; 2. School of Mathematics and System Sciences, Shandong University, Jinan 250100, Shandong, China
Abstract:By employing one direction S-rough sets, the concepts of knowledge addition and knowledge battlement generated by knowledge addition were presented, where knowledge battlement has dynamic characteristic. Then rough knowledge battlement generation was given, and the generation principle and the reversion theorem of rough knowledge battlement were proposed. Furthermore, the discernibility metric of rough knowledge battlement was given, and the recognition rule and recognition theorem of rough knowledge battlement were proposed. Finally the applications were given.
Keywords:one direction S-rough sets  knowledge addition  knowledge battlement  rough knowledge battlement  rough knowledge battlement recognition
本文献已被 维普 万方数据 等数据库收录!
点击此处可从《山东大学学报(理学版)》浏览原始摘要信息
点击此处可从《山东大学学报(理学版)》下载免费的PDF全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号