基于代数方程组的属性约简研究  

Research of Attribute Reduction Based on Algebraic Equations

作　　者：苗夺谦[1,2] 周杰[1,2] 张楠[1,2] 冯琴荣[1,2] 王睿智[1,2] 

机构地区：[1]同济大学嵌入式系统与服务计算教育部重点实验室,上海201804 [2]同济大学计算机科学与技术系,上海201804

出　　处：《电子学报》2010年第5期1021-1027,共7页Acta Electronica Sinica

基　　金：国家自然科学基金(No.60475019;No.60775036);教育部博士点专项基金(No.20060247039)

摘　　要：属性约简是粗糙集理论重要研究内容之一,求取决策表所有属性约简已被证明为NP-难问题.本文基于吴方法,从代数方程组角度给出了一种求解所有属性约简的新思路.UCI数据集和人工数据集实验表明了该新方法的有效性.Attribute reduction is one of the most important notions in rough set theory. It has been proved that finding all reducts of a decision table is a NP-hard problem. Based on Wu＇ s method, a novel approach to acquire all reducts is put forward from the perspective of algebraic equations in this paper. The efficiency of this novel method can be illustrated by experiments with UCI datasets and synthetic datasets.

关 键 词：决策表 属性约简 分辨函数 吴方法 特征列 

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