检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:高天宇 王庆荣[1] 杨磊 GAO Tianyu;WANG Qingrong;YANG Lei(School of Electronic and Information Engineering,Lanzhou Jiaotong University,Lanzhou 730070,China)
机构地区:[1]兰州交通大学电子与信息工程学院,兰州730070
出 处:《计算机工程与应用》2021年第3期87-93,共7页Computer Engineering and Applications
基 金:国家自然科学基金(71961016);教育部人文社会科学研究规划基金(15XJAZH002,18YJAZH148);甘肃省自然科学基金(18JR3RA125)。
摘 要:在粗糙集的核心方法属性约简理论中,针对次要属性过多时属性依赖度一致引发的约简困难现象,以粗糙集属性依赖度强化为基本方法构建数据挖掘模型。模型中,计算各属性在组合中的依赖度,将组合中的依赖度合并于各属性从而强化属性依赖度。为合理化计算过程,给出一种离散化方法并构建探索模型进行实验,缩小离散量范围与属性组合范围。最后所得依赖度作为属性重要性,挖掘重要属性。实验证明,在部分地区5级以上震后经济损失影响因素分析中,比较传统属性约简,该模型可更有效地分析属性之间的重要性,解决了约简困难的问题,使用测试数据时该模型与传统方法的结果有86%的一致性。As the core of rough set,the attribute reduction theory is difficult to make a reduction when there are too many secondary attributes.Based on the enhanced attribute dependability of rough set,a data mining model is constructed.In this model,the dependability of each attribute in group is calculated,and the dependability in combination is merged into each attribute to enhance the attribute dependability.For the rational of exploration model calculation process,a exploration model and a discretization method are built.The range of discrete quantity and attribute combination is narrowed.As the value of attributes,the obtained dependability is used to find the important attributes.The experimental results show that compared with the traditional attribute reduction,this model can more effectively analyze the importance of attributes and solve the difficult problem of reduction in the analysis of factors affecting the economic loss after the earthquake of magnitude 5 or above in some areas.The result of this model in test data is 86% consistent with that of the traditional method.
关 键 词:数据挖掘 粗糙集 属性约简 强化属性依赖度 粒度 经济损失
分 类 号:TP391[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:3.139.237.30