托普西斯
中心性
计算机科学
理想溶液
数据挖掘
相似性(几何)
复杂网络
节点(物理)
钥匙(锁)
灰色关联分析
鉴定(生物学)
理想(伦理)
数学优化
人工智能
运筹学
数学
统计
认识论
图像(数学)
热力学
物理
生物
结构工程
工程类
万维网
哲学
植物
计算机安全
作者
Pingle Yang,Xin Liu,Guiqiong Xu
标识
DOI:10.1142/s0217984918502160
摘要
Identifying the influential nodes in complex networks is a challenging and significant research topic. Though various centrality measures of complex networks have been developed for addressing the problem, they all have some disadvantages and limitations. To make use of the advantages of different centrality measures, one can regard influential node identification as a multi-attribute decision-making problem. In this paper, a dynamic weighted Technique for Order Preference by Similarity to Ideal Solution (TOPSIS) is developed. The key idea is to assign the appropriate weight to each attribute dynamically, based on the grey relational analysis method and the Susceptible–Infected–Recovered (SIR) model. The effectiveness of the proposed method is demonstrated by applications to three actual networks, which indicates that our method has better performance than single indicator methods and the original weighted TOPSIS method.
科研通智能强力驱动
Strongly Powered by AbleSci AI