期刊文献+

考虑关联性与优先关系的区间犹豫模糊图决策 被引量:7

Interval-Valued Hesitant Fuzzy Graphs Decision Making with Correlations and Prioritization Relationships
下载PDF
导出
摘要 区间犹豫模糊集是区间数和犹豫模糊集的推广,通常用以描述不确定信息具备的不完备性与犹豫性.近年来,区间犹豫模糊多属性决策问题受到了学者们的广泛关注.针对属性间同时具有关联性与优先关系的区间犹豫模糊多属性决策问题,利用模糊图可通过顶点间的边表示属性间关联性的优势,研究基于区间犹豫模糊图的多属性决策方法.首先从定义、运算规则及映射关系的角度建立区间犹豫模糊图的相关概念.在此基础上,提出考虑关联性与优先关系的区间犹豫模糊图多属性决策方法.最后用实例及对比性分析阐述所提多属性决策方法的可行性与有效性.结果表明:相较于经典区间犹豫模糊多属性决策方法,所提方法能够合理求解属性间同时具有关联性与优先关系的区间犹豫模糊多属性决策问题. Interval-valued hesitant fuzzy sets are generalizations of interval numbers and hesitant fuzzy sets,which are usually used to depict the incompleteness and hesitancy in uncertain information.In recent years,interval-valued hesitant fuzzy multi-attribute decision making problems have received extensive attentions of scholars.In allusion to interval-valued hesitant fuzzy multi-attribute decision making problems that are possessed with correlations and prioritization relationships between attributes at the same time,by taking advantages of fuzzy graphs could represent the correlations between attributes through edges between vertices,this paper studies multi-attribute decision making approaches based on interval-valued hesitant fuzzy graphs.Firstly,the related notion of interval-valued hesitant fuzzy graphs is established from the aspect of definitions,operation rules and mapping relationships.Based on the constructed notion,an approach to interval-valued hesitant fuzzy graphs in multi-attribute decision making with correlations and prioritization relationships is proposed.At last,a case study along with a comparative analysis is given to illustrate the feasibility and efficiency of the proposed multi-attribute decision making approach.Compared with classical interval-valued hesitant fuzzy multi-attribute decision making approaches,the results show that the proposed approach could reasonably solve interval-valued hesitant fuzzy multi-attribute decision making problems that are characterized by correlations and prioritization relationships between attributes at the same time.
作者 张超 李德玉 Zhang Chao;Li Deyu(Key Laboratory of Computational Intelligence and Chinese Information Processing(Shanxi University),Ministry of Education,Taiyuan 030006;School of Computer and Information Technology,Shanxi University,Taiyuan 030006)
出处 《计算机研究与发展》 EI CSCD 北大核心 2019年第11期2438-2447,共10页 Journal of Computer Research and Development
基金 国家自然科学基金项目(61806116,61672331,61603278,61573231) 军民共用重大研究计划联合基金重点项目(U1435212) 山西省科技基础平台建设项目(2015091001-0102) 山西省自然科学基金项目(201801D221175) 山西省高等学校科技创新项目(201802014) 山西省高等学校青年科研人员培育计划~~
关键词 区间犹豫模糊集 关联性 优先关系 区间犹豫模糊图 多属性决策 interval-valued hesitant fuzzy sets correlations prioritization relationships interval-valued hesitant fuzzy graphs multi-attribute decision making
  • 相关文献

参考文献5

二级参考文献63

  • 1陈勇,胡爱群,胡啸.通信网中节点重要性的评价方法[J].通信学报,2004,25(8):129-134. 被引量:89
  • 2Asthana S, King O K, Gibbons F D, et al. Predicting protein complex membership using probabilistic network reliability[J]. GenomeResearch, 2004, 14(6): 1170-1175.
  • 3Swamynathan G, Wilson C, Boe B, et al. Do social networks improve E-commerce7 : A study on social rnarketpiaces [C]// Proc of the 1st Workshop on Online Social Networks. New York: ACM, 2008:1-6.
  • 4Ghosh J, Ngo H Q, Yoon S, et al. On a routing problem within probabiiistic graphs and its application to intermittently connected networks [C] //Proc of 1NFOCOM'07. Piscataway, NJ: IEEE, 2007:1721-1729.
  • 5Pandurangan G, Raghavan P, Upfal E. Building low diameter peer-to-peer networks [J]. IEEE Journal on Selected Areas in Communications, 2003, 21(6): 995-1002.
  • 6Aggarwal C C. Advances in Database System[M]. Berlin: Springer, 2009.
  • 7Yuan Y, Chen L, Wang G. Efficiently answering probability threshold-based shortest path queries over uncertain graphs [C] // Proc of DASFFA'10. Berlin: Springer, 2010: 155- 170.
  • 8Li J, Zou Z, Gao H. Mining frequent subgraphs over uncertain graph databases under probabilistie semantics [EB/OL]. (2012-0228) [2012-06 -20]. http: / /www. springerlink, corn/content/6666p1933v743g38/.
  • 9Jin R, Liu L, Ding B, et al. Distance-constraint reaehability computation in uncertain graphs[J]. PVLDB, 2011, 4 (9) 551-562.
  • 10Colbourn C J. The Combinatorics of Network Reliability[M]. New York:Oxford University Press, 1987.

共引文献21

同被引文献50

引证文献7

二级引证文献11

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部