核心概念
The authors propose an algorithm, AIS, for link recommendation to enhance social influence diffusion, providing a high-probability approximate solution with theoretical guarantees.
摘要
The paper addresses the challenge of link recommendation for social influence maximization in online social networks. It introduces the IMA problem and presents the AIS algorithm as a solution. The algorithm aims to select edges to augment the influence spread of a seed set efficiently. By leveraging reverse influence sampling and efficient estimators, AIS achieves theoretical guarantees and outperforms existing methods in experiments on various datasets.
統計資料
The IMA problem is proven to be NP-hard.
AIS provides a (1 − 1/e − 𝜀)-approximate solution with a high probability of 1 − 𝛿.
AIS runs in 𝑂(𝑘2(𝑚 +𝑛) log(𝑛/𝛿)/𝜀2 +𝑘 |𝐸C|) time.
引述
"The combination of link recommendation with information diffusion in OSNs opens up new opportunities for product marketing."
"In contrast to previous works on influence maximization, the authors focus on recommending links that can augment social influence."