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

基于区分对象对的不完备决策表求核
引用本文:曾艳燕,徐章艳,曾玲珍,张姣,宋腊香. 基于区分对象对的不完备决策表求核[J]. 计算机工程与应用, 2013, 49(19): 104-107
作者姓名:曾艳燕  徐章艳  曾玲珍  张姣  宋腊香
作者单位:1.广西师范大学 计算机科学与信息工程学院,广西 桂林 5410042.江西蓝天学院 商学院,南昌 3300293.鄂州市高级中学,湖北 鄂州 436000
基金项目:国家自然科学基金(No.60963008);广西自然科学基金(No.2011GXNSFA018163)。
摘    要:在差别矩阵的基础上,针对不完备决策表提出了基于差别矩阵的区分对象对集定义,并证明求不完备决策表的核可以转化到求基于差别矩阵的区分对象对集上。在此基础上,提出了一种基于区分对象对的不完备决策表求核算法,该算法的时间复杂度为:[max{O(|C||U||Upos|),O(K|C||U|)}],优于同类算法的时间复杂度;用实例说明了新算法的有效性。

关 键 词:粗糙集  不完备决策表  差别矩阵  区分对象对集  求核  

Computing core based on discernibility object pair set in incomplete decision table
ZENG Yanyan , XU Zhangyan , ZENG Lingzhen , ZHANG Jiao , SONG Laxiang. Computing core based on discernibility object pair set in incomplete decision table[J]. Computer Engineering and Applications, 2013, 49(19): 104-107
Authors:ZENG Yanyan    XU Zhangyan    ZENG Lingzhen    ZHANG Jiao    SONG Laxiang
Affiliation:1.School of Computer Science and Information Engineering, Guangxi Normal University, Guilin, Guangxi 541004, China2.School of Business, Jiangxi Blue Sky College, Nanchang 330029, China3.Ezhou Senior Middle School, Ezhou, Hubei 436000, China
Abstract:The definition of discernibility object pair set of incomplete decision table, based on discernibility matrix, is defined. And it is proved that computing the core of incomplete decision table is equal to computing the discernibility object pair set of incomplete decision table. Then an algorithm for computing core based on discernibility object pair set of incomplete decision table is proposed. And the time complexity of the new algorithm is [max{O(K|C||U|),O(|C||U||Upos|)}], which is better than the time complexity of the same kind of algorithms. At last, an example is used to illustrate the efficiency of the new algorithm.
Keywords:rough set  incomplete decision table  discernibility matrix  discernibility object pair set  compute core
本文献已被 万方数据 等数据库收录!
点击此处可从《计算机工程与应用》浏览原始摘要信息
点击此处可从《计算机工程与应用》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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