检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]重庆邮电大学理学院,北京100876 [2]北京邮电大学计算机学院,北京100876 [3]重庆邮电大学计算机科学与技术学院,重庆400065
出 处:《控制与决策》2016年第7期1199-1205,共7页Control and Decision
基 金:国家自然科学基金项目(61472056);大学生科研训练计划项目(A2014-45)
摘 要:基于Pawlak粗糙集的属性约简一般保持决策表的正区域不变,然而由于现实中不同用户对不同约简精度的需求,获取属性值的实际代价与个人偏好可能不同.针对决策者主观个人偏好、客观约简精度、获取属性值的实际代价和决策表各区域的误判代价等综合情况,提出新的约简算法,并讨论约简代价与约简精度间的关系.通过遗传算法,采用启发式方法搜索出局部最优约简子集.仿真实验表明,所提出的算法操作性强,更适合处理实际决策问题.Generally, when talking about attribute reduction of a decision table, it usually keeps the positive region unchanged based on the Pawlak's rough sets theory. However, the needs may be different for different precision of the reduction in real life as well as the actual cost to obtain attribute values and personal preferences. Based on the risk of personal preference for the subjective aspect, the accuracy of reduction, the actual cost of obtaining attribute value, and the risk of interval misjudgment for the objective aspects, a novel attribute reduction algorithm is proposed. Then, the relationship between the reduction cost and the reduction accuracy is discussed. Based on the genetic algorithm, a heuristic method for searching the local optimal reduction subset is proposed. Simulation experiments show that the algorithm is feasible, and more realistic to deal with practical decision-making problems.
关 键 词:决策粗糙集 属性重要度 代价函数 用户偏好 属性约简
分 类 号:TP18[自动化与计算机技术—控制理论与控制工程]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.117