A novel approach for location promotion on location-based social networks

N. Hai
{"title":"A novel approach for location promotion on location-based social networks","authors":"N. Hai","doi":"10.1109/RIVF.2015.7049874","DOIUrl":null,"url":null,"abstract":"Maximizing the spread of influence was recently studied in several models of social networks. For location-based social networks, it also plays an important role, so a further research about this field is necessary. In this study, based on users' movement histories and their friendships, we first design the Predicting Mobility in the Near Future (PMNF) model to capture human mobility. Human mobility is inferred from the model by taking into account the following three features: (1) the regular movement of users, (2) the movement of friends of users, (3) hot regions, the most attractive places for all users. Second, from the result of predicting movements of users at each location, we determine influence of each user on friends with the condition that friends are predicted to come to the location. Third, the Influence Maximization (IM) algorithms are proposed to find a set of k influential users who can make the maximum influence on their friends according to either the number of influenced users (IM num) or the total of probability of moving the considered location of influenced users (IM score). The model and algorithms are evaluated on three large datasets collected by from 40,000 to over 60,000 users for each dataset over a period of two years in the real world at over 500,000 checked-in points as well as 400,000 to nearly 2,000,000 friendships also considered. The points are clustered into locations by density-based clustering algorithms such as OPTICS and GRID. As a result, our algorithms give an order of magnitude better performance than baseline approaches like choosing influential users based on the number of check-ins of users and selecting influential users by the number of friends of users. From the result of experiments, we are able to apply to some areas like advertisement to get the most efficient with the minimum costs. We show that our framework reliably determines the most influential users with high accuracy.","PeriodicalId":166971,"journal":{"name":"The 2015 IEEE RIVF International Conference on Computing & Communication Technologies - Research, Innovation, and Vision for Future (RIVF)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-02-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"The 2015 IEEE RIVF International Conference on Computing & Communication Technologies - Research, Innovation, and Vision for Future (RIVF)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/RIVF.2015.7049874","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 6

Abstract

Maximizing the spread of influence was recently studied in several models of social networks. For location-based social networks, it also plays an important role, so a further research about this field is necessary. In this study, based on users' movement histories and their friendships, we first design the Predicting Mobility in the Near Future (PMNF) model to capture human mobility. Human mobility is inferred from the model by taking into account the following three features: (1) the regular movement of users, (2) the movement of friends of users, (3) hot regions, the most attractive places for all users. Second, from the result of predicting movements of users at each location, we determine influence of each user on friends with the condition that friends are predicted to come to the location. Third, the Influence Maximization (IM) algorithms are proposed to find a set of k influential users who can make the maximum influence on their friends according to either the number of influenced users (IM num) or the total of probability of moving the considered location of influenced users (IM score). The model and algorithms are evaluated on three large datasets collected by from 40,000 to over 60,000 users for each dataset over a period of two years in the real world at over 500,000 checked-in points as well as 400,000 to nearly 2,000,000 friendships also considered. The points are clustered into locations by density-based clustering algorithms such as OPTICS and GRID. As a result, our algorithms give an order of magnitude better performance than baseline approaches like choosing influential users based on the number of check-ins of users and selecting influential users by the number of friends of users. From the result of experiments, we are able to apply to some areas like advertisement to get the most efficient with the minimum costs. We show that our framework reliably determines the most influential users with high accuracy.
一种基于位置的社交网络位置推广的新方法
最近在几个社会网络模型中对影响力传播最大化进行了研究。对于基于位置的社交网络,它也发挥着重要的作用,因此有必要对这一领域进行进一步的研究。在这项研究中,基于用户的运动历史和他们的友谊,我们首先设计了预测近期流动性(PMNF)模型来捕捉人类的流动性。通过考虑以下三个特征,从模型中推断出人类的移动性:(1)用户的定期移动,(2)用户朋友的移动,(3)热点地区,即对所有用户最具吸引力的地方。其次,从预测每个位置的用户运动的结果中,我们确定每个用户对朋友的影响,条件是预测朋友会来该位置。第三,提出影响力最大化算法,根据受影响用户的数量(IM num)或受影响用户移动考虑位置的概率总和(IM score),找出k个对朋友影响最大的有影响力的用户。模型和算法是在三个大型数据集上进行评估的,每个数据集由4万到6万多名用户在两年的时间里收集,在现实世界中有超过50万个签到点,以及40万到近200万个友谊。这些点通过基于密度的聚类算法(如OPTICS和GRID)聚类到不同的位置。因此,我们的算法比根据用户签到次数选择有影响力的用户和根据用户的朋友数量选择有影响力的用户等基准方法的性能要好一个数量级。从实验结果来看,我们可以将其应用于广告等领域,以最小的成本获得最高的效率。结果表明,该框架能够可靠、准确地确定最具影响力的用户。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信