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

偏好关系粗近似的一种新方法
引用本文:花文健,刘作良. 偏好关系粗近似的一种新方法[J]. 计算机应用研究, 2004, 21(12): 23-25
作者姓名:花文健  刘作良
作者单位:空军工程大学,电讯工程学院,陕西,西安,710077;空军工程大学,电讯工程学院,陕西,西安,710077
基金项目:国家“863”计划资助项目(863-306-04-02-1)
摘    要:提出一种多准则方案对偏好程度粗度量的一般方法。构造了一种从参考方案集中获取偏好规则并用于全体方案排序和优选的算法。将参考方案对的偏好关系定量分级表示,应用粗集理论的近似原理对综合偏好关系进行粗近似以获取基于偏好信息的决策规则。计算实例表明新方法能充分表示决策者的偏好,有效避免了规则不一致性。

关 键 词:分级优先关系  粗近似  决策规则
文章编号:1001-3695(2004)12-0023-03

A Novel Method of Rough Approximation of Preference Relation
HUA Wen-jian,LIU Zuo-liang. A Novel Method of Rough Approximation of Preference Relation[J]. Application Research of Computers, 2004, 21(12): 23-25
Authors:HUA Wen-jian  LIU Zuo-liang
Abstract:A new method for rough measurement of the preference degree between action pairs in MCDM is presented based on the Rough Sets theory. The preference degree of each reference action pair is quantificationally described by the set of intervals. The comprehensive preference relations of the reference action pairs are approximated respectively by the upper set and the lower set to derive the preference information potential in reference action set in terms of decision rules with no inconsistence found in LRES method. A computational study shows that new method based on the graded preference relation achieves significant improvement over the method based on the indiscernibility relation.
Keywords:Graded Preference Relation   Rough Approxim Ation   Decision Rules
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《计算机应用研究》浏览原始摘要信息
点击此处可从《计算机应用研究》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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