Budget-aware local influence iterative algorithm for efficient influence maximization in social networks

Abstract

The budgeted influence maximization (BIM) problem aims to identify a set of seed nodes that adhere to predefined budget constraints within a specified network structure and cost model. However, it is difficult for the existing algorithms to achieve a balance between timeliness and effectiveness. To address this challenge, our study initially proposes a refined cost model through empirical scrutiny of Weibo's quote data. Subsequently, we introduce a proxy-based algorithm, i.e., the budget-aware local influence iterative (BLII) algorithm tailored for the BIM problem, aimed at expediently identifying seed nodes. The algorithm approximates the global influence by leveraging the user's one-hop influence and circumvents influence overlap among seed nodes via iterative influence updates. Comparative experiments involving eight algorithms across four real networks demonstrate the effectiveness, efficiency, and robustness of the BLII algorithm. In terms of influence spread, the proposed algorithm outperforms other proxy-based algorithms by 20%–255 % and reaches the state-of-the-art simulation-based approach by 96 %. In addition, the running time of the BLII algorithm is reasonable. Generally, the proposed cost model and BLII algorithm provide novel insights and potent tools for studying BIM problems.

Keywords

• Budgeted influence maximization
• Cost model
• Proxy-based algorithm
• Social networks