Social-Network-Assisted Task Recommendation Algorithm in Mobile Crowd Sensing

Sitong Chen, Xujia Zhao, Jiahao Liu, Guoju Gao, Yang Du
{"title":"Social-Network-Assisted Task Recommendation Algorithm in Mobile Crowd Sensing","authors":"Sitong Chen, Xujia Zhao, Jiahao Liu, Guoju Gao, Yang Du","doi":"10.1145/3535735.3535751","DOIUrl":null,"url":null,"abstract":"With the popularity of mobile smart devices, collecting data has become more convenient. Freeing from the constraints of professional equipment, Mobile Crowd Sensing (MCS) has gained wide attention. As the key component of MCS system, task recommendation directly affects the quantity and quality of task completion. However, most of previous task recommendation modules in MCS system only consider the situation where users complete tasks independently, without further consideration of the possibility that users can seek assistance through social networks. In this paper, we come up with a task recommendation algorithm combined social networks to maximize the number of completed tasks. We build up a user-task rating matrix based on the number of tasks performed by each user, and then we use the matrix factorization method to get the latent factor matrix. According to the latent factor matrix, we greedily select some tasks for each user. Next, we calculate the user extroversion and intimacy with others through social networks data to get the probability of users asking for help from their friends. We get the scoring matrix and task recommendation list, considering that users could complete the task together. Finally, we conduct lots of experiments based on a real-world dataset, and the experimental results show that our solution outperforms the existing algorithms.","PeriodicalId":435343,"journal":{"name":"Proceedings of the 7th International Conference on Information and Education Innovations","volume":"27 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-04-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 7th International Conference on Information and Education Innovations","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3535735.3535751","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

With the popularity of mobile smart devices, collecting data has become more convenient. Freeing from the constraints of professional equipment, Mobile Crowd Sensing (MCS) has gained wide attention. As the key component of MCS system, task recommendation directly affects the quantity and quality of task completion. However, most of previous task recommendation modules in MCS system only consider the situation where users complete tasks independently, without further consideration of the possibility that users can seek assistance through social networks. In this paper, we come up with a task recommendation algorithm combined social networks to maximize the number of completed tasks. We build up a user-task rating matrix based on the number of tasks performed by each user, and then we use the matrix factorization method to get the latent factor matrix. According to the latent factor matrix, we greedily select some tasks for each user. Next, we calculate the user extroversion and intimacy with others through social networks data to get the probability of users asking for help from their friends. We get the scoring matrix and task recommendation list, considering that users could complete the task together. Finally, we conduct lots of experiments based on a real-world dataset, and the experimental results show that our solution outperforms the existing algorithms.
移动人群感知中的社交网络辅助任务推荐算法
随着移动智能设备的普及,收集数据变得更加方便。移动人群传感(MCS)摆脱了专业设备的限制,得到了广泛的关注。任务推荐作为MCS系统的关键组成部分,直接影响任务完成的数量和质量。然而,以往MCS系统中的任务推荐模块大多只考虑用户独立完成任务的情况,没有进一步考虑用户通过社交网络寻求帮助的可能性。在本文中,我们提出了一种结合社交网络的任务推荐算法,以最大化完成任务的数量。根据每个用户执行的任务数量建立用户任务评级矩阵,然后利用矩阵分解方法得到潜在因素矩阵。根据潜在因素矩阵,我们为每个用户贪婪地选择一些任务。接下来,我们通过社交网络数据计算用户的外向性和与他人的亲密度,得到用户向朋友寻求帮助的概率。考虑到用户可以一起完成任务,得到评分矩阵和任务推荐列表。最后,我们在一个真实数据集上进行了大量的实验,实验结果表明我们的解决方案优于现有的算法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信