基于样本选择的启发式属性约简方法研究  

New Heuristic Attribute Reduction Algorithm Based on Sample Selection

作　　者：杨习贝[1,2] 颜旭[1] 徐苏平[1] 于化龙[1] 

机构地区：[1]江苏科技大学计算机科学与工程学院,镇江212003 [2]南京理工大学经济管理学院,南京210094

出　　处：《计算机科学》2016年第1期40-43,共4页Computer Science

基　　金：国家自然科学基金(61100116;61305058);江苏省青蓝工程中青年学术带头人人才项目;中国博士后科学基金项目(2014M550293)资助

摘　　要：属性约简是粗糙集理论的核心研究内容之一。借鉴于贪心策略的启发式算法是求解约简的一种有效技术手段。传统的启发式算法使用了决策系统中的所有样本,但实际上每个样本对约简的贡献程度是不同的,这在一定程度上增加了启发式算法的时间消耗。为解决这一问题,提出了一种基于样本选择的启发式算法,该算法主要分为3步:首先从样本集中挑选出重要的样本;然后利用选取出的样本构建新的决策系统;最后利用启发式算法求解约简。实验结果表明,新算法能够有效地减少约简的求解时间。Attribute reduction is one of the important topics in rough set theory.Heuristic attribute reduction algorithm with greedy strategy is one of the widely used approaches to compute reduction.Traditional heuristic algorithm uses all of the samples in the information system.However,it should be noticed that for a data set,different samples contribute different importance to find reduction,and it follows that the time efficiency of the heuristic attribute reduction algorithm suffers from the redundant samples.To solve such problem,a heuristic attribute reduction algorithm based on sample selection was proposed.The algorithm is composed of three stages.Firstly,the most informative samples are selected.Secondly,a new information system is formed by using these selected samples.Finally,one of the reductions can be computed by using heuristic algorithm.The experimental results show that the proposed algorithm can efficiently reduce the computational time.

关 键 词：信息系统 样本选择 粗糙集 属性约简 

分 类 号：TP391[自动化与计算机技术—计算机应用技术]