检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:王志成 高灿[1,2] 邢金明 WANG Zhi-cheng;GAO Can;XING Jin-ming(College of Computer Science and Software Engineering,Shenzhen University,Guangdong 518060,China;Key Laboratory of Intelligent Information Processing,Shenzhen University,Guangdong 518060,China)
机构地区:[1]深圳大学计算机与软件学院,广东深圳518060 [2]深圳大学智能信息处理重点实验室,广东深圳518060
出 处:《计算机科学》2022年第4期168-173,共6页Computer Science
基 金:国家自然科学基金(61806127,62076164);佛山市教育局项目(2019XJZZ05)。
摘 要:属性约简是三支决策理论的重要研究内容之一。然而,现有基于三支决策的属性约简方法过于严格,限制了其属性约简的效率。文中提出了一种基于正域的三支近似属性约简方法。具体地,属性约简被视为根据条件属性与决策属性的相关性,将所有属性划分为正域、负域或边界域3类的过程。首先通过保留正域度量来去除负域属性,然后通过放松正域度量来迭代地排除一些边界属性,最后将剩余属性构成一个近似约简。UCI数据实验结果显示,与其他代表性的方法相比,所提方法能在保持甚至提升性能的同时获得更小的属性约简,说明了所提方法的有效性。Attribute reduction is one of the most important research topics in the theory of three-way decision.However,the existing attribute reduction methods based on three-way decision are too strict,which limit the efficiency of attribute reduction.In this paper,a three-way approximate attribute reduction method based on the positive region is proposed.More specifically,attribute reduction is considered as the process of determining attributes as positive,boundary,or negative ones according to their correlation to the decision attribute.The negative attributes are first removed by retaining the measure of the positive region.Then,some of the boundary attributes are iteratively excluded by relaxing the positive region measure.Finally,an approximate reduction is formed by the remaining attributes.Extensive experiments on UCI data sets demonstrate that the proposed method can achieve much smaller reducts with the same or even better performance in comparison with other representative methods,showing the effectiveness in attribute reduction.
分 类 号:TP391[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.49