首页> 外文会议>Aisa-Pacific web and web-age information management joint conference on web and big data >AERIAL: An Efficient Randomized Incentive-Based Influence Maximization Algorithm
【24h】

AERIAL: An Efficient Randomized Incentive-Based Influence Maximization Algorithm

机译:航空:一种有效的基于随机激励的影响最大化算法

获取原文

摘要

In social networks, once a user is more willing to influence her neighbors, a larger influence spread will be boosted. Inspired by the economic principle that people respond rationally to incentives, properly incentivizing users will lift their tendencies to influence their neighbors, resulting in a larger influence spread. However, this phenomenon is ignored in traditional IM studies. This paper presents a new diffusion model, IB-IC Model (Incentive-based Independent Cascade Model), to describe this phenomenon, and considers maximizing the influence spread under this model. However, this work faces great challenge under high solution quality and time efficiency. To tackle the problem, we propose AERIAL algorithm with solutions not worse than existing methods in high probability and 0(n2) average running time. We conduct experiments on several real-world networks and demonstrate that our algorithms are effective for solving IM Problem under IB-IC Model.
机译:在社交网络中,一旦用户更愿意影响自己的邻居,就会扩大更大的影响力传播范围。受到人们对激励措施做出合理反应的经济原理的启发,适当地激励用户可以提高他们影响邻居的趋势,从而扩大影响范围。但是,这种现象在传统的IM研究中被忽略了。本文介绍了一种新的扩散模型,即IB-IC模型(基于激励的独立级联模型)来描述这种现象,并考虑在此模型下最大化影响扩散。但是,这项工作在高解决方案质量和时间效率的情况下面临着巨大的挑战。为了解决这个问题,我们提出了AERIAL算法,其解决方案的概率不高于现有方法,平均运行时间为0(n2)。我们在多个真实世界的网络上进行了实验,并证明了我们的算法对于解决IB-IC模式下的IM问题是有效的。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号