计算机工程与应用 ›› 2010, Vol. 46 ›› Issue (27): 39-42.DOI: 10.3778/j.issn.1002-8331.2010.27.010

• 研究、探讨 • 上一篇    下一篇

基于单向S-粗集对偶的知识堆垒与知识垛识别

何荣福1，张 凌2   

  1. 1.武夷学院 数学与计算机系，福建 武夷山 354300
    2.龙岩学院 数学与计算机科学学院，福建 龙岩 364000
  • 收稿日期:2009-03-12 修回日期:2009-05-08 出版日期:2010-09-21 发布日期:2010-09-21
  • 通讯作者: 何荣福

Dual of one direction S-rough sets-based knowledge addition and knowledge battlement recognition

HE Rong-fu2，ZHANG Ling1   

  1. 1.Department of Mathematics and Computer Science，Wuyi University，Wuyishan，Fujian 354300，China
    2.School of Mathematics and Computer Science，Longyan University，Longyan，Fujian 364000，China
  • Received:2009-03-12 Revised:2009-05-08 Online:2010-09-21 Published:2010-09-21
  • Contact: HE Rong-fu

PDF

摘要： 利用单向S-粗集对偶（dual of singular rough sets），给出知识堆垒及其生成的知识垛的概念，知识垛具有动态特性；给出粗知识垛的生成，提出粗知识垛生成原理及粗知识垛的还原定理，提出粗知识垛分辨尺度及识别准则与识别定理，给出应用。

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

Abstract: By employing dual of one direction S-rough sets（dual of singular rough sets），the concepts of knowledge addition and knowledge battlement generated by knowledge addition are presented，where knowledge battlement has dynamic characteristic；then rough knowledge battlement generation is given，the generation principle and the reversion theorem of rough knowledge battlement are proposed.Furthermore the discernibility metric of rough knowledge battlement is presented，the recognition rule and the recognition theorem of rough knowledge battlement are proposed.Finally the applications are given.

Key words: dual of one direction S-rough sets, knowledge addition, knowledge battlement, rough knowledge battlement, rough knowledge battlement recognition

中图分类号: 

京ICP备13024262号-1
Copyright © 《计算机工程与应用》编辑部
技术支持：北京玛格泰克科技发展有限公司
总访问量
今日访问
在线人数