新的基于区分对象集的邻域粗糙集属性约简算法.docVIP

新的基于区分对象集的邻域粗糙集属性约简算法 　　摘要：基于正域的属性约简算法是利用“下近似”思想，仅考虑被正确区分样本数的约简算法。借鉴“上近似”的思想，利用“邻域信息粒”的概念定义了区分对象集，探讨了其基本性质，并提出了基于区分对象集的属性重要度度量及启发式属性约简算法。该约简算法既考虑信息决策表的相对正域，也考虑以核属性为启发信息逐个增加条件属性时对边界域样本的影响。通过实例分析，说明了所提算法的可行性，并且以6个UCI标准数据集为实验对象，与基于正域的属性约简算法进行对比实验。实验结果说明，采用提出的约简算法得到的约简属性集，与基于正域的属性约简算法相比，在进行分类任务时的分类精度能够保持不变或有所提高。 　　关键词：属性约简；属性重要度；相对正域；邻域粗糙集；分类精度 　　中图分类号： TP18； TP311.13 　　文献标志码：A 　　New attribute reduction algorithm of neighborhood rough set based on distinguished object set 　　LIANG Hailong， XIE Jun*， XU Xinying， REN Mifeng 　　College of Information Engineering， Taiyuan University of Technology， Taiyuan Shanxi 030024， China 　　Abstract： 　　Since the algorithm of attribute reduction based on positive region is based on the thought of lower approximation， it just considers the right distinguished samples. Using the thought of upper approximation and the concept of neighborhood information granule， the distinguished object set with its basic characteristics was designed and analyzed， then the new attribute importance measurement based on distinguished object set and heuristic attribute reduction algorithm was proposed. The proposed algorithm considered both the relative positive region of information decision table and the influence on boundary samples when growing condition attributes. The feasibility of the algorithm was discussed by instance analysis， and the comparative experiments on UCI data set with attribute reduction algorithm based on positive region were carried out. The experimental results show that the proposed attribute reduction algorithm can get better reduction， and the classification precision of sample set can remain the same or has certain improvement. 　　英文关键词Key words： 　　attribute reduction； attribute importance； relative positive region； neighborhood rough set； classification precision 　　0引言 　　波兰学者Pawlak提出了一种处理不精确、不确定和不相容知识的数学工具――粗糙集理论[1]。经过三十多年的研究与发展，粗糙集理论已经成功地用于处理依赖性知识发现、规则提取、分类和属性约简等问题。 　　属性约简是粗糙集理论中的一个重要研究内容。根据对属性重要度的度量，属性约简的方法可以分为三大类，基于