检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:罗豪[1] 续欣莹[1] 谢珺[1] 张扩[1] 谢新林
出 处:《计算机应用》2016年第11期2958-2962,共5页journal of Computer Applications
基 金:山西省自然科学基金资助项目(2014011018-2);山西省回国留学人员科研资助项目(2013-033;2015-45)~~
摘 要:针对当前的邻域粗糙集多用于处理完备的信息系统,而非不完备的信息系统这一问题,提出了一种可用于处理不完备混合信息系统的扩展容差关系,并给出相关定义,使用容差完备度和邻域阈值作为限制条件计算扩展容差邻域,以此邻域为基础选择决策正域得到系统的属性重要性,并以该重要性作为启发因子给出基于扩展容差关系的属性约简算法。采用UCI数据集中的7组不同类型的数据集进行仿真实验,并分别与扩展邻域关系(EN)、容差邻域熵(TRE)、邻域粗糙集(NR)的方法进行比较,实验结果表明,该方法在保证分类精度的同时能够约简得到更少的属性。最后讨论了在扩展容差关系中改变邻域阈值对分类精度产生的影响。Current neighborhood rough sets have been usually used to solve complete information system, not incomplete system. In order to solve this problem, an extended tolerance relation was proposed to deal with the incomplete mixed information system, and associative definitions were provided. The degree of complete tolerance and neighborhood threshold were used as the constraint conditions to find the extended tolerance neighborhood. The attribute importance of the system was got by the decision positive region within the neiborhood, and the attribute reduction algorithm based on the extended tolerance relation was proposed, which was given by the importance as the heuristic factor. Seven different types of data sets on UCI database was used for simulation, and the proposed method was compared with Extension Neighborhood relation (EN), Tolerance Neighborhood Entropy (TRE) and Neighborhood Rough set (NR) respectively. The experimental results show that, the proposed algorithm can ensure accuracy of classification, select less attributes by reduction. Finally, the influence of neighborhood threshold in extended tolerance relation on classification accuracy was discussed.
关 键 词:邻域粗糙集 不完备信息 属性约简 属性重要性 邻域阈值
分 类 号:TP181[自动化与计算机技术—控制理论与控制工程]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.249