检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]龙岩学院数学与计算机科学学院,福建龙岩364000 [2]山东大学数学与系统科学学院,山东济南250100
出 处:《山东大学学报(理学版)》2008年第10期12-17,共6页Journal of Shandong University(Natural Science)
基 金:山东省自然科学基金资助项目(Y2007H02);福建省教育厅A类科技项目资助项目(JA07176);福建省资助省属高校项目(2008F5042)
摘 要:利用单向S-粗集,给出知识堆垒及它生成的知识垛的概念,知识垛具有动态特性,给出粗知识垛的生成,提出粗知识垛生成原理及还原定理,提出粗知识垛分辨尺度及识别准则与识别定理,并给出应用。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.
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.177