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

基于容差关系的多粒度粗糙集中近似集动态更新方法
引用本文:徐怡,肖鹏.基于容差关系的多粒度粗糙集中近似集动态更新方法[J].计算机应用,2019,39(5):1247-1251.
作者姓名:徐怡  肖鹏
作者单位:计算智能与信号处理教育部重点实验室(安徽大学),合肥,230039;计算智能与信号处理教育部重点实验室(安徽大学),合肥230039;安徽大学计算机科学与技术学院,合肥230601
基金项目:国家自然科学基金资助项目(61402005);安徽省自然科学基金资助项目(1308085QF114);安徽省高等学校省级自然科学基金资助项目(KJ2013A015);安徽大学计算智能与信号处理教育部重点实验室课题项目。
摘    要:针对不完备信息系统变化时缺失值获取具体属性值的特性,为解决多粒度粗糙集中更新近似集时间效率低的问题,提出了一种基于容差关系的近似集动态更新算法。首先,讨论了基于容差关系的近似集变化的性质,并根据相关性质得出乐观、悲观多粒度粗糙集的近似集的变化趋势;然后,针对更新容差类效率低的问题,提出了动态更新容差类的定理;最后,在此基础上,设计出基于容差关系的近似集动态更新算法。采用UCI数据库中4个数据集进行仿真实验,当数据集变大时,所提更新算法的计算时间远小于静态更新算法的计算时间,即所提动态更新算法的时间效率高于静态算法,验证了所提算法的正确性和高效性。

关 键 词:不完备信息系统  多粒度  动态更新  容差关系多粒度粗糙集  近似集
收稿时间:2018-10-15
修稿时间:2018-12-10

Dynamic updating method of approximations in multigranulation rough sets based on tolerance relation
XU Yi,XIAO Peng.Dynamic updating method of approximations in multigranulation rough sets based on tolerance relation[J].journal of Computer Applications,2019,39(5):1247-1251.
Authors:XU Yi  XIAO Peng
Affiliation:1. Key Laboratory of Intelligent Computing and Signal Processing, Ministry of Education(Anhui University), Hefei Anhui 230039, China;2. School of Computer Science and Technology, Anhui University, Hefei Anhui 230601, China
Abstract:Focused on the issue that missing attribute values are obtained when an incomplete information system changes, in order to solve the problem of low time efficiency of updating the approximations in a multigranulation rough sets, a dynamic update algorithm based on tolerance relationship was proposed. Firstly, the properties of the approximations change based on tolerance relationship were discussed, and the change trends of the approximations of optimistic and pessimistic multigranulation rough sets were obtained according to the relevant properties. Then, a theorem of dynamic update tolerance class was proposed for the problem of low efficiency of updating tolerance class. Based on this, a dynamic update algorithm based on tolerance relationship was proposed. The simulation experiments were carried out using four data sets in UCI database. When the data set becomes larger, the calculation time of the proposed update algorithm is much smaller than that of the static update algorithm. The experimental results show that the time efficiency of the proposed dynamic update algorithm is higher than that of the static algorithm, which verifies the correctness and efficiency of the proposed algorithm.
Keywords:incomplete information system  multigranulation  dynamic update  tolerance relationship multigranulation rough sets  approximations  
本文献已被 维普 万方数据 等数据库收录!
点击此处可从《计算机应用》浏览原始摘要信息
点击此处可从《计算机应用》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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