Overexposure-Aware Influence Maximization

Author:

Loukides Grigorios1ORCID,Gwadera Robert2,Chang Shing-Wan3

Affiliation:

1. King’s College London, Aldwych, London, United Kingdom

2. Cardiff University, Roath, Cardiff, United Kingdom

3. Middlesex University, The Burroughs, Hendon, London, United Kingdom

Abstract

Viral marketing campaigns are often negatively affected by overexposure. Overexposure occurs when users become less likely to favor a promoted product after receiving information about the product from too large a fraction of their friends. Yet, existing influence diffusion models do not take overexposure into account, effectively overestimating the number of users who favor the product and diffuse information about it. In this work, we propose the first influence diffusion model that captures overexposure. In our model, Latency Aware Independent Cascade Model with Overexposure (LAICO), the activation probability of a node representing a user is multiplied (discounted) by an overexposure score, which is calculated based on the ratio between the estimated and the maximum possible number of attempts performed to activate the node. We also study the influence maximization problem under LAICO. Since the spread function in LAICO is non-submodular, algorithms for submodular maximization are not appropriate to address the problem. Therefore, we develop an approximation algorithm that exploits monotone submodular upper and lower bound functions of spread, and a heuristic that aims to maximize a proxy function of spread iteratively. Our experiments show the effectiveness and efficiency of our algorithms.

Publisher

Association for Computing Machinery (ACM)

Subject

Computer Networks and Communications

Reference45 articles.

1. A. Awan. 2015. Less is more: You are about to receive less email from LinkedIn. Retrieved from https://blog.linkedin.com/2015/07/27/less-email-from-linkedin?sf11404748=1. A. Awan. 2015. Less is more: You are about to receive less email from LinkedIn. Retrieved from https://blog.linkedin.com/2015/07/27/less-email-from-linkedin?sf11404748=1.

2. R. Abebe L. A. Adamic and J. Kleinberg. 2018. Mitigating overexposue in viral marketing. In AAAI. R. Abebe L. A. Adamic and J. Kleinberg. 2018. Mitigating overexposue in viral marketing. In AAAI.

3. F. Alkemade and C. Castaldi. 2005. Strategies for the diffusion of innovations on social networks. Comp. Econ. 25 1 (2005). F. Alkemade and C. Castaldi. 2005. Strategies for the diffusion of innovations on social networks. Comp. Econ. 25 1 (2005).

4. Integrating user-perceived quality into Web server design

5. J. A. Bilmes and W. Bai. 2017. Deep submodular functions. CoRR abs/1701.08939 (2017). J. A. Bilmes and W. Bai. 2017. Deep submodular functions. CoRR abs/1701.08939 (2017).

Cited by 3 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

1. Equilibrium of individual concern-critical influence maximization in virtual and real blending network;Information Sciences;2023-11

2. Chinese Contemporary Music Diffusion Strategy Based on Public Opinion Maximization;Mobile Information Systems;2022-06-28

3. Reconfiguration Problems on Submodular Functions;Proceedings of the Fifteenth ACM International Conference on Web Search and Data Mining;2022-02-11

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3