基于在线学习的移动人群感知中多专业意识的参与者选择

Hanshang Li, Ting Li, Fan Li, Song Yang, Yu Wang
{"title":"基于在线学习的移动人群感知中多专业意识的参与者选择","authors":"Hanshang Li, Ting Li, Fan Li, Song Yang, Yu Wang","doi":"10.1109/MASS.2018.00067","DOIUrl":null,"url":null,"abstract":"With the rapid increasing of smart phones and their embedded sensing technologies, mobile crowd sensing (MCS) becomes an emerging sensing paradigm for performing large-scale sensing tasks. One of the key challenges of large-scale mobile crowd sensing systems is how to effectively select the minimum set of appropriate participants from the huge user pool to perform the tasks. However, the capabilities of individual participants are usually unknown by the selection mechanism, which leads to the most challenging issue of participant selection. While online learning techniques can be used to learn the participant's capability, the diverse expertise of each individual makes a single capability metric is not sufficient. To address the multi-expertise of participants, in this paper we introduce a new self-learning architecture which leverages the historical performing records of participants to learn the different capabilities (both sensing probability and time delay) of participants. Formulating the participant selection problem as a combinational multi-armed bandit problem, we present an online participant selection algorithm with both performance guarantee and bounded regret. Extensive simulations with a real-world mobile dataset demonstrate the efficiency of the proposed solution.","PeriodicalId":146214,"journal":{"name":"2018 IEEE 15th International Conference on Mobile Ad Hoc and Sensor Systems (MASS)","volume":"49 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":"{\"title\":\"Multi-expertise Aware Participant Selection in Mobile Crowd Sensing via Online Learning\",\"authors\":\"Hanshang Li, Ting Li, Fan Li, Song Yang, Yu Wang\",\"doi\":\"10.1109/MASS.2018.00067\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"With the rapid increasing of smart phones and their embedded sensing technologies, mobile crowd sensing (MCS) becomes an emerging sensing paradigm for performing large-scale sensing tasks. One of the key challenges of large-scale mobile crowd sensing systems is how to effectively select the minimum set of appropriate participants from the huge user pool to perform the tasks. However, the capabilities of individual participants are usually unknown by the selection mechanism, which leads to the most challenging issue of participant selection. While online learning techniques can be used to learn the participant's capability, the diverse expertise of each individual makes a single capability metric is not sufficient. To address the multi-expertise of participants, in this paper we introduce a new self-learning architecture which leverages the historical performing records of participants to learn the different capabilities (both sensing probability and time delay) of participants. Formulating the participant selection problem as a combinational multi-armed bandit problem, we present an online participant selection algorithm with both performance guarantee and bounded regret. Extensive simulations with a real-world mobile dataset demonstrate the efficiency of the proposed solution.\",\"PeriodicalId\":146214,\"journal\":{\"name\":\"2018 IEEE 15th International Conference on Mobile Ad Hoc and Sensor Systems (MASS)\",\"volume\":\"49 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"7\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2018 IEEE 15th International Conference on Mobile Ad Hoc and Sensor Systems (MASS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/MASS.2018.00067\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 IEEE 15th International Conference on Mobile Ad Hoc and Sensor Systems (MASS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/MASS.2018.00067","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 7

摘要

随着智能手机及其嵌入式传感技术的快速发展,移动人群传感(MCS)成为执行大规模传感任务的新兴传感范式。大规模移动人群传感系统的关键挑战之一是如何从庞大的用户池中有效地选择最小的合适参与者集来执行任务。然而,个体参与者的能力通常不为选择机制所知,这导致了参与者选择的最具挑战性的问题。虽然在线学习技术可以用来了解参与者的能力,但每个人的不同专业知识使得单一的能力度量是不够的。为了解决参与者的多专业知识问题,本文引入了一种新的自学习架构,该架构利用参与者的历史表现记录来学习参与者的不同能力(包括感知概率和时间延迟)。将参与者选择问题表述为组合多臂强盗问题,提出了一种既有性能保证又有有限遗憾的在线参与者选择算法。广泛的模拟与现实世界的移动数据集证明了所提出的解决方案的效率。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Multi-expertise Aware Participant Selection in Mobile Crowd Sensing via Online Learning
With the rapid increasing of smart phones and their embedded sensing technologies, mobile crowd sensing (MCS) becomes an emerging sensing paradigm for performing large-scale sensing tasks. One of the key challenges of large-scale mobile crowd sensing systems is how to effectively select the minimum set of appropriate participants from the huge user pool to perform the tasks. However, the capabilities of individual participants are usually unknown by the selection mechanism, which leads to the most challenging issue of participant selection. While online learning techniques can be used to learn the participant's capability, the diverse expertise of each individual makes a single capability metric is not sufficient. To address the multi-expertise of participants, in this paper we introduce a new self-learning architecture which leverages the historical performing records of participants to learn the different capabilities (both sensing probability and time delay) of participants. Formulating the participant selection problem as a combinational multi-armed bandit problem, we present an online participant selection algorithm with both performance guarantee and bounded regret. Extensive simulations with a real-world mobile dataset demonstrate the efficiency of the proposed solution.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信