电子科技大学学报2017，Vol.46Issue(2)：441-448,8.DOI:10.3969/j.issn.1001-0548.2017.02.020
基于LeaderRank和节点相似度的复杂网络重要节点排序算法
Node Ranking in Complex Networks Based on LeaderRank and Modes Similarity
摘要
Abstract
The effect of important nodes in complex networks on the structure and function of the networks causes widespread concern. This paper presents a SRank algorithm based on LeaderRank and nodes similarity which is used to measure the interaction between nodes. The simulation of SIR model and Spearman's correlation coefficient on real social networks show that the SRankalgorithm preforms better on identifying influential nodes both in directed and undirected networks, compared with the other four classical algorithms.关键词
复杂网络/重要节点/相似度/SRank算法Key words
complex networks/important nodes/nodes similarity/SRank algorithm分类
信息技术与安全科学引用本文复制引用
顾亦然,朱梓嫣..基于LeaderRank和节点相似度的复杂网络重要节点排序算法[J].电子科技大学学报,2017,46(2):441-448,8.基金项目
教育部人文社会科学研究规划基金(15YJZH016) （15YJZH016）
