一种属性约简的探测性贪婪算法  

Exploration Greedy Algorithm with Attribute Reduction

作　　者：李旻[1,2] 陈卫东[1] 

机构地区：[1]华南师范大学计算机学院,广州510631 [2]华南师范大学招生办,广州510631

出　　处：《计算机工程》2012年第19期163-166,共4页Computer Engineering

基　　金：国家自然科学基金资助项目(60973150;11071089);广东省自然科学基金资助项目(10451063101006313)

摘　　要：贪婪算法一旦做出贪婪选择就不能反悔,因此设计简单、执行速度快,但其搜索空间过于狭小,从而降低了贪婪解的精度。针对该问题,提出一种属性约简的探索性贪婪算法,采用前景探测策略提高贪婪解的精度。实验结果表明,该算法在时间略有增加的情况下能提高解的精度。Greedy algorithms make local optimal choices step by step without regretting later,which makes them easy to design and have a high running speed,but the quality of greedy solutions is generally undesirable due to their very small searching space.In this paper,a greedy algorithm with exploration is presented and an exploration strategy is introduced to improve the quality of greedy solution.Experimental results show that the algorithm obviously outperforms the original greedy algorithm in the solution quality with slightly increased running time.

关 键 词：粗糙集 属性约简 贪婪算法 探测策略 正区域 

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构]