A Heuristic Mixed Model for Viral Marketing Cost Minimization in Social Networks

A. Talukder, DoHyeon Kim, C. Hong
{"title":"A Heuristic Mixed Model for Viral Marketing Cost Minimization in Social Networks","authors":"A. Talukder, DoHyeon Kim, C. Hong","doi":"10.1109/ICOIN.2019.8718136","DOIUrl":null,"url":null,"abstract":"The Influence maximization (IM) aims at estimating a small number of influential users that maximize the viral marketing profit whereas, the Reverse Influence Maximization (RIM) deals with the minimization of Viral Marketing (VM) cost in social networks. Here, the VM cost is measured by the minimum number of nodes that are required to activate seed nodes and the profit is defined by the maximum number of nodes influenced by seed users when they are initially activated. However, most of the existing works focus on the profit maximization without considering the VM cost. Thus, in this research, we introduce a Viral Marketing Cost (VMC) Minimization problem and propose a Heuristic Mixed (HM) approach under mixed Reverse Independent Cascade (RIC) and Reverse Linear Threshold (RLT) diffusion models. The proposed HM model employs the greedy technique along with a heuristic approach to optimize the VM cost. Moreover, our model resolves the challenging issues of the RIM problem more efficiently. Finally, we simulate our model using data-sets of two real social networks, and the result shows that our model outperforms the baseline and existing models.","PeriodicalId":422041,"journal":{"name":"2019 International Conference on Information Networking (ICOIN)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 International Conference on Information Networking (ICOIN)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICOIN.2019.8718136","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5

Abstract

The Influence maximization (IM) aims at estimating a small number of influential users that maximize the viral marketing profit whereas, the Reverse Influence Maximization (RIM) deals with the minimization of Viral Marketing (VM) cost in social networks. Here, the VM cost is measured by the minimum number of nodes that are required to activate seed nodes and the profit is defined by the maximum number of nodes influenced by seed users when they are initially activated. However, most of the existing works focus on the profit maximization without considering the VM cost. Thus, in this research, we introduce a Viral Marketing Cost (VMC) Minimization problem and propose a Heuristic Mixed (HM) approach under mixed Reverse Independent Cascade (RIC) and Reverse Linear Threshold (RLT) diffusion models. The proposed HM model employs the greedy technique along with a heuristic approach to optimize the VM cost. Moreover, our model resolves the challenging issues of the RIM problem more efficiently. Finally, we simulate our model using data-sets of two real social networks, and the result shows that our model outperforms the baseline and existing models.
社交网络中病毒式营销成本最小化的启发式混合模型
影响力最大化(IM)旨在估计少数有影响力的用户,使病毒式营销利润最大化,而反向影响力最大化(RIM)则涉及社交网络中病毒式营销(VM)成本的最小化。在这里,VM成本是由激活种子节点所需的最小节点数来衡量的,而利润是由最初激活种子用户时受其影响的最大节点数来定义的。然而,现有的研究大多着眼于利润最大化,而没有考虑虚拟机成本。因此,在本研究中,我们引入了病毒营销成本(VMC)最小化问题,并在混合反向独立级联(RIC)和反向线性阈值(RLT)扩散模型下提出了一种启发式混合(HM)方法。提出的HM模型采用了贪心技术和启发式方法来优化虚拟机成本。此外,我们的模型更有效地解决了RIM问题的挑战性问题。最后,我们使用两个真实社交网络的数据集对我们的模型进行了仿真,结果表明我们的模型优于基线模型和现有模型。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信