Yong Hua1, Bolun Chen1,2,*, Yan Yuan1, Guochang Zhu1, Jialin Ma1
CMC-Computers, Materials & Continua, Vol.59, No.2, pp. 517-531, 2019, DOI:10.32604/cmc.2019.05278
Abstract The influence maximization is the problem of finding k seed nodes that maximize the scope of influence in a social network. Therefore, the comprehensive influence of node needs to be considered, when we choose the most influential node set consisted of k seed nodes. On account of the traditional methods used to measure the influence of nodes, such as degree centrality, betweenness centrality and closeness centrality, consider only a single aspect of the influence of node, so the influence measured by traditional methods mentioned above of node is not accurate. In this paper, we obtain the More >
Login
Register
