摘要
属性约简是Rough集理论的核心内容之一,计算所有的属性约简已经被证明是NP完全问题。本文基于分而自治思想,在Skowron分明矩阵法的基础上,给出了最小析取范式的判定定理,从而提出了计算所有属性约简的算法。理论分析和实验结果表明,该约简算法在效率上较现有的算法有显著提高。
Attribute reduction is one of the basic contents, it is NP-complete problem to calculate all attribute reduc- tions. Based on dividing and conquering thought, the judgement theorem with respect to minimal disjunctive normal form is obtained based on Skowron discernibility matrix, from which an algorithm for all attribute reductions is pre- sented. Theoretical analysis and experimental results show that the algorithm is much more efficient in comparison with those existing algorithm.
出处
《计算机科学》
CSCD
北大核心
2005年第4期42-44,共3页
Computer Science
基金
科技部电子政务关键技术及应用系统研究项目的资助(项目编号:2001BA110B01)
