Promoting a bundle of locations via viral marketing in location-based social networks

Guanyao Li, Zi-Yi Wen, Wen-Yuan Zhu
{"title":"Promoting a bundle of locations via viral marketing in location-based social networks","authors":"Guanyao Li, Zi-Yi Wen, Wen-Yuan Zhu","doi":"10.1109/TAAI.2016.7880165","DOIUrl":null,"url":null,"abstract":"With the popularity of smartphones, many users utilize the check-in function to share their current activity with their friends for more social interactions in location-based social networks (LBSNs). Due to the success of viral marketing for advertising, prior works have tried to exploit viral marketing for location promotion via check-in in LBSNs. This means that k users will be selected to check in at a target location to let as many users as possible check in by the propagation of check-in. However, the prior works discuss promoting only one location at a time. This is ineffective for retail chains to promote their retail stores since they have to select k users to promote for each retail store. In this paper, we focus on selecting k users who will check in at the location in a given bundle of locations to maximize the number of users who will check in at at least one location in the given location bundle by the information propagation in an LBSN. To solve this problem, we first propose the Multi-Location-aware Independent Cascade Model (MLICM) to describe the information of a bundle of locations propagated in an LBSN. Then, we propose algorithms to effectively and efficiently select k users based on MLICM. The experimental results show that our approach outperforms than that of the state-of-the-art approaches using two real datasets.","PeriodicalId":159858,"journal":{"name":"2016 Conference on Technologies and Applications of Artificial Intelligence (TAAI)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 Conference on Technologies and Applications of Artificial Intelligence (TAAI)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/TAAI.2016.7880165","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

Abstract

With the popularity of smartphones, many users utilize the check-in function to share their current activity with their friends for more social interactions in location-based social networks (LBSNs). Due to the success of viral marketing for advertising, prior works have tried to exploit viral marketing for location promotion via check-in in LBSNs. This means that k users will be selected to check in at a target location to let as many users as possible check in by the propagation of check-in. However, the prior works discuss promoting only one location at a time. This is ineffective for retail chains to promote their retail stores since they have to select k users to promote for each retail store. In this paper, we focus on selecting k users who will check in at the location in a given bundle of locations to maximize the number of users who will check in at at least one location in the given location bundle by the information propagation in an LBSN. To solve this problem, we first propose the Multi-Location-aware Independent Cascade Model (MLICM) to describe the information of a bundle of locations propagated in an LBSN. Then, we propose algorithms to effectively and efficiently select k users based on MLICM. The experimental results show that our approach outperforms than that of the state-of-the-art approaches using two real datasets.
在基于位置的社交网络上通过病毒式营销推广一系列地点
随着智能手机的普及,许多用户利用签到功能与朋友分享他们当前的活动,在基于位置的社交网络(LBSNs)上进行更多的社交互动。由于病毒式营销在广告方面的成功,之前的作品试图利用病毒式营销在LBSNs中通过签到进行位置推广。这意味着将选择k个用户在目标位置签入,以便通过签入的传播让尽可能多的用户签入。然而,之前的作品讨论一次只推广一个地点。这对于零售连锁店来说是无效的,因为他们必须为每个零售商店选择k个用户进行推广。在本文中,我们关注的是在给定位置束中选择k个将在给定位置束中至少一个位置签入的用户,从而通过LBSN中的信息传播使在给定位置束中至少一个位置签入的用户数量最大化。为了解决这个问题,我们首先提出了多位置感知独立级联模型(MLICM)来描述在LBSN中传播的一束位置信息。在此基础上,提出了基于MLICM的k用户有效选择算法。实验结果表明,我们的方法优于使用两个真实数据集的最先进的方法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信