优势关系下基于浓缩布尔矩阵的属性约简方法  

Attribute Reduction Based on Concentration Boolean Matrix under Dominance Relations

作　　者：李艳[1] 郭娜娜[1] 吴婷婷[1] 湛燕[1] LI Yan;GUO Na-na;WU Ting-ting;ZHAN Yan(Key Lab of Machine Learning and Computational Intelligence,College of Mathematics and Information Science, Hebei University,Baoding,Hebei 071002,China)

机构地区：[1]河北大学数学与信息科学学院河北省机器学习与计算智能重点实验室,河北保定071002

出　　处：《计算机科学》2018年第10期229-234,共6页Computer Science

基　　金：国家自然科学基金(61170040;61473111);河北大学自然科学研究计划项目(799207217069)资助

摘　　要：在优势关系粗糙集方法(DRSA)的框架下,针对不协调的目标信息系统求属性约简。基于优势矩阵的方法是最常用的一类约简方法,但矩阵中不是所有的元素都有效。浓缩优势矩阵只保留对求约简有用的最小属性集,因而可以明显降低约简过程中的计算量。进一步地,浓缩布尔矩阵通过布尔代数的形式有效地弥补了优势矩阵生成效率低的缺点。文中将等价关系上的浓缩布尔矩阵属性约简方法扩展到优势关系上,针对优势矩阵提出了浓缩布尔矩阵的概念,建立了相应的高效约简方法,使效率得到明显提高。最后采用9组UCI数据进行实验,结果验证了所提方法的有效性。Under the framework of dominance relation-based rough set approach(DRSA),attribute reduction was stu-died for inconsistent target information systems.The methods based on dominance matrix are the most commonly used ones,but not all elements in the matrix are valid.The concentration dominance matrix only preserves the smallest set of attributes which are useful for attribute reduction,and thus the computational complexity can be significantly reduced.On the other side,the concentration Boolean matrix further improves the generation efficiency of the dominance matrix by Boolean algebra.This paper extended the concentration Boolean matrix method under equivalence relations to that under dominance relations.The concept of concentration Boolean matrix was proposed for the dominance matrix,and the corresponding efficient reduction method was established to improve the efficiency of the reduction algorithm.Finally,nine UCI data sets were used in the experiments,and the results show the feasibility and effectiveness of the proposed method.

关 键 词：粗糙集 属性约简 优势关系 浓缩优势矩阵 浓缩布尔矩阵 

分 类 号：TP181[自动化与计算机技术—控制理论与控制工程]