摘要
针对传统投影算子无法解决投影相同时二元语义排序问题,定义了在二元语义信息下,方案与正负理想点形成向量,提出了基于正、负理想点的双向投影贴近度计算公式;并研究了属性权重已知条件下双向投影贴近度的测算,最后以具体的算例说明了方法的有效性和可行性.
Vectors between a decision and its positive and negative ideal points under two- tuple linguistics are defined and a bi-directional projection close degree calculation formula based on positive and negative ideal points is proposed to solve the problem that traditional projection operators cannot figure out the two-tuple linguistics sequence when the projections are the same. The solution of bi-directional projection close degree with the given attribute weight is studied. Finally, a specific case study proves the validity and feasibility of the proposed method.
出处
《数学的实践与认识》
北大核心
2015年第20期44-51,共8页
Mathematics in Practice and Theory
基金
国家自然科学基金项目(71363046
91324003)
国家社科重点项目(12AZD102)
校教改项目(1304JG0914Z)
教育部人文社科(10YJA790174
13YJC790198)
关键词
群决策
双向投影算子
二元语义
贴近度
group decision making
bi-directional projection oPerator
two-tuple linguisticsclose degree