An Influence Maximization Algorithm Based On The Mixed Importance Of Nodes

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 met...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Computers, materials & continua materials & continua, 2019-01, Vol.59 (2), p.517-531
Hauptverfasser: Hua, Yong, Chen, Bolun, Yuan, Yan, Zhu, Guochang, Ma, Jialin
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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 following result through experimental analysis: the influence of a node is relevant not only to its degree and coreness, but also to the degree and coreness of the n-order neighbor nodes. Hence, we propose a algorithm based on the mixed importance of nodes to measure the comprehensive influence of node, and the algorithm we proposed is simple and efficient. In addition, the performance of the algorithm we proposed is better than that of traditional influence maximization algorithms.
ISSN:1546-2226
1546-2218
1546-2226
DOI:10.32604/cmc.2019.05278