An efficient path-based approach for influence maximization in social networks

作者：

Highlights：

• HIPA estimated the influence spread calculated in greedy approach.

• Ineffective nodes are pruned efficiently to reduce the computation.

• HIPA Reduces the running time while improves the influence spread.

• The operations can be parallelized to perform on large-scale networks.

摘要

•HIPA estimated the influence spread calculated in greedy approach.•Ineffective nodes are pruned efficiently to reduce the computation.•HIPA Reduces the running time while improves the influence spread.•The operations can be parallelized to perform on large-scale networks.

论文关键词：Social network,Influence maximization,Information spreading,Independent influence path

论文评审过程：Received 6 December 2019, Revised 23 September 2020, Accepted 24 October 2020, Available online 2 November 2020, Version of Record 10 February 2021.

论文官网地址：https://doi.org/10.1016/j.eswa.2020.114168