MPAC: Maximizing Product Adoption considering the profitability of communities

Milad Vadoodparast, F. Taghiyareh, Vahid Erfanifar
{"title":"MPAC: Maximizing Product Adoption considering the profitability of communities","authors":"Milad Vadoodparast, F. Taghiyareh, Vahid Erfanifar","doi":"10.1109/ISTEL.2014.7000765","DOIUrl":null,"url":null,"abstract":"Maximizing product adoption in viral marketing is the task of choosing a small set of seed nodes in a social network so that by their approval to adopt the product, they influence others and lead to large number of adoptions. In this paper, a special case is investigated in which nodes, because of their potential profitability, are not of the same importance to the sales manager. We assign importance weight values to the communities of nodes that are most likely to share the same characteristics and are of the same importance to the seeker of seed nodes. We define MPAC, Maximizing Product Adoption considering the profitability of Communities that is the problem of selecting seed nodes such that the spread of influence results in maximum profit. This is done by activating nodes residing within weighted communities which worth the cost of activating. Three algorithms are proposed to solve MPAC. Our empirical studies on an online social network consisted of 23628 nodes show that one of them outperforms the others by the overall profits gained and as more as the weighting method assigns larger values to small communities, the proposed algorithm performs better.","PeriodicalId":417179,"journal":{"name":"7'th International Symposium on Telecommunications (IST'2014)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"7'th International Symposium on Telecommunications (IST'2014)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISTEL.2014.7000765","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

Abstract

Maximizing product adoption in viral marketing is the task of choosing a small set of seed nodes in a social network so that by their approval to adopt the product, they influence others and lead to large number of adoptions. In this paper, a special case is investigated in which nodes, because of their potential profitability, are not of the same importance to the sales manager. We assign importance weight values to the communities of nodes that are most likely to share the same characteristics and are of the same importance to the seeker of seed nodes. We define MPAC, Maximizing Product Adoption considering the profitability of Communities that is the problem of selecting seed nodes such that the spread of influence results in maximum profit. This is done by activating nodes residing within weighted communities which worth the cost of activating. Three algorithms are proposed to solve MPAC. Our empirical studies on an online social network consisted of 23628 nodes show that one of them outperforms the others by the overall profits gained and as more as the weighting method assigns larger values to small communities, the proposed algorithm performs better.
MPAC:考虑社区的盈利能力,最大化产品采用
在病毒式营销中,最大化产品接受度的任务是在社交网络中选择一小部分种子节点,这样通过他们对产品的认可,他们就会影响其他人,并导致大量的接受。本文研究了一种特殊情况,在这种情况下,由于潜在的盈利能力,节点对销售经理的重要性并不相同。我们为最有可能具有相同特征且对种子节点的搜索者具有相同重要性的节点社区分配重要权重值。我们定义MPAC,最大化产品采用考虑社区的盈利能力,这是选择种子节点的问题,使影响力的传播产生最大的利润。这是通过激活驻留在加权社区内的节点来完成的,这些节点值得激活。提出了三种求解MPAC的算法。我们对一个由23628个节点组成的在线社交网络进行了实证研究,结果表明其中一个节点的整体收益优于其他节点,并且权重方法赋予小社区的值越大,所提出的算法的性能越好。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:604180095
Book学术官方微信