计算机工程2012，Vol.38Issue(4)：46-48,3.
一种完备的最小属性约简方法
Complete Minimal Attribute Reduction Method
摘要
Abstract
Attribute reduction is the basic problem of rough sets theory. A method for minimal attributes reduction in consistent decision table is proposed in this paper. The discernible information in consistent decision tables is described with discernible vector array. A minimal attribute reduction tree is generated based on the probability of the attributes which discern two objects. All minimal attribute reductions are got from minimal attributes reduction tree. The result of the method is proved to be complete and minimal.关键词
粗糙集/决策表/差别属性集/差别向量组/最小属性约简树/最小属性约简Key words
rough set/ decision table/ discernible attribute set/ discernible vector array/ minimal attribute reduction tree/ minimal attribute分类
信息技术与安全科学引用本文复制引用
于海燕,乔晓东..一种完备的最小属性约简方法[J].计算机工程,2012,38(4):46-48,3.基金项目
中国博士后科学基金资助项目“叙词表的自动集成及领域本体构建方法研究”(2011M500370) （2011M500370）
