Influence maximization based on the realistic independent cascade model

作者：

Highlights：

• Proposed the realistic independent cascade (RIC) model which is suited to the real-world network.

• Based on RIC model, three new seeding algorithms are proposed.

• M-greedy and D-greedy reduce the time consuming of R-greedy.

• Experiments on different networks proved the superiority of the proposed algorithms.

摘要

•Proposed the realistic independent cascade (RIC) model which is suited to the real-world network.•Based on RIC model, three new seeding algorithms are proposed.•M-greedy and D-greedy reduce the time consuming of R-greedy.•Experiments on different networks proved the superiority of the proposed algorithms.

论文关键词：Diffusion model,Influence maximization,Social networks,Seeding algorithm

论文评审过程：Received 12 July 2019, Revised 14 September 2019, Accepted 23 November 2019, Available online 30 November 2019, Version of Record 8 February 2020.

论文官网地址：https://doi.org/10.1016/j.knosys.2019.105265