首页 | 本学科首页   官方微博 | 高级检索  
     

一种属性与值约简简化算法
引用本文:韩燮,杨炳儒.一种属性与值约简简化算法[J].小型微型计算机系统,2004,25(2):245-247.
作者姓名:韩燮  杨炳儒
作者单位:1. 华北工学院,计算机科学与技术系,山西,太原,030051;北京科技大学,信息学院,北京,100083
2. 北京科技大学,信息学院,北京,100083
基金项目:国家自然基金项目 (6983 5 0 0 1)资助,山西省自然基金资助 (2 0 0 110 40 )
摘    要:Rough Set理论是处理不确定性知识、不完整数据的重要工具,在Rough Set中属性最小约简与规则提取NP—hard的.本文针对现有属性约简与值约简算法的问题,分析了区分矩阵的特性,在此基础上,提出了属性与值约简的简化算法,并用实例作了验证.

关 键 词:Rough  Set理论  属性约简  值约简
文章编号:1000-1220(2004)02-0245-03

Simplified Algorithm for Attribute Reduction and Value Reduction
HAN Xie ,YANG Bing-ru.Simplified Algorithm for Attribute Reduction and Value Reduction[J].Mini-micro Systems,2004,25(2):245-247.
Authors:HAN Xie    YANG Bing-ru
Affiliation:HAN Xie 1,2,YANG Bing-ru2 1
Abstract:Rough Set theory, a important tool dealing with uncertainty and incomplete information, was introduced by Pawlak in 1982. Attribute reduction and value reduction are one of the key problems for the knowledge acquisition. Based on the rough set theory, the paper has made use of the characteristic of discernibility matrix and has presented a new attribute reduction and value reduction algorithm. The complexity of acquired rule knowledge can be reduced effectively in this way.
Keywords:rough set theory  attribute reduction  value reduction
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号