摘要
属性约简是粗糙集理论重要研究内容之一,求取决策表所有属性约简已被证明为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.
出处
《电子学报》
EI
CAS
CSCD
北大核心
2010年第5期1021-1027,共7页
Acta Electronica Sinica
基金
国家自然科学基金(No.60475019
No.60775036)
教育部博士点专项基金(No.20060247039)
关键词
决策表
属性约简
分辨函数
吴方法
特征列
decision table
attribute reduction
discernibility function
Wu＇s method
characteristic sets
