• 文献检索
  • 文档翻译
  • 深度研究
  • 学术资讯
  • Suppr Zotero 插件Zotero 插件
  • 邀请有礼
  • 套餐&价格
  • 历史记录
应用&插件
Suppr Zotero 插件Zotero 插件浏览器插件Mac 客户端Windows 客户端微信小程序
定价
高级版会员购买积分包购买API积分包
服务
文献检索文档翻译深度研究API 文档MCP 服务
关于我们
关于 Suppr公司介绍联系我们用户协议隐私条款
关注我们

Suppr 超能文献

核心技术专利:CN118964589B侵权必究
粤ICP备2023148730 号-1Suppr @ 2026

文献检索

告别复杂PubMed语法,用中文像聊天一样搜索,搜遍4000万医学文献。AI智能推荐,让科研检索更轻松。

立即免费搜索

文件翻译

保留排版,准确专业,支持PDF/Word/PPT等文件格式,支持 12+语言互译。

免费翻译文档

深度研究

AI帮你快速写综述,25分钟生成高质量综述,智能提取关键信息,辅助科研写作。

立即免费体验

使用贪婪随机自适应过程解决移动众包中的用户选择问题。

Using Greedy Random Adaptive Procedure to Solve the User Selection Problem in Mobile Crowdsourcing.

作者信息

Yang Jian, Ban Xiaojuan, Xing Chunxiao

机构信息

School of Computer and Communication Engineering, Beijing Key Laboratory of Knowledge Engineering for Materials Science, University of Science and Technology Beijing, Beijing 100083, China.

Research Institute of Information, Beijing National Research Center for Information Science and Technology, Department of Computer Science and Technology, Institute of Internet Industry, Tsinghua University, Beijing 100084, China.

出版信息

Sensors (Basel). 2019 Jul 18;19(14):3158. doi: 10.3390/s19143158.

DOI:10.3390/s19143158
PMID:31323780
原文链接:https://pmc.ncbi.nlm.nih.gov/articles/PMC6679560/
Abstract

With the rapid development of mobile networks and smart terminals, mobile crowdsourcing has aroused the interest of relevant scholars and industries. In this paper, we propose a new solution to the problem of user selection in mobile crowdsourcing system. The existing user selection schemes mainly include: (1) find a subset of users to maximize crowdsourcing quality under a given budget constraint; (2) find a subset of users to minimize cost while meeting minimum crowdsourcing quality requirement. However, these solutions have deficiencies in selecting users to maximize the quality of service of the task and minimize costs. Inspired by the marginalism principle in economics, we wish to select a new user only when the marginal gain of the newly joined user is higher than the cost of payment and the marginal cost associated with integration. We modeled the scheme as a marginalism problem of mobile crowdsourcing user selection (MCUS-marginalism). We rigorously prove the MCUS-marginalism problem to be NP-hard, and propose a greedy random adaptive procedure with annealing randomness (GRASP-AR) to achieve maximize the gain and minimize the cost of the task. The effectiveness and efficiency of our proposed approaches are clearly verified by a large scale of experimental evaluations on both real-world and synthetic data sets.

摘要

随着移动网络和智能终端的快速发展,移动众包引起了相关学者和行业的关注。在本文中,我们针对移动众包系统中的用户选择问题提出了一种新的解决方案。现有的用户选择方案主要包括:(1)在给定预算约束下找到用户子集以最大化众包质量;(2)找到用户子集以在满足最低众包质量要求的同时最小化成本。然而,这些解决方案在选择用户以最大化任务服务质量和最小化成本方面存在不足。受经济学中的边际主义原则启发,我们希望仅在新加入用户的边际收益高于支付成本和与整合相关的边际成本时才选择新用户。我们将该方案建模为移动众包用户选择的边际主义问题(MCUS - 边际主义)。我们严格证明了MCUS - 边际主义问题是NP难问题,并提出了一种具有退火随机性的贪婪随机自适应过程(GRASP - AR)以实现任务收益最大化和成本最小化。通过对真实世界和合成数据集进行的大规模实验评估,清楚地验证了我们提出的方法的有效性和效率。

https://cdn.ncbi.nlm.nih.gov/pmc/blobs/f209/6679560/78c26a0db97e/sensors-19-03158-g008.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/f209/6679560/30b4eff32136/sensors-19-03158-g001.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/f209/6679560/77a9b88a2da2/sensors-19-03158-g002.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/f209/6679560/11828660e02a/sensors-19-03158-g003.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/f209/6679560/6f07fb3d9a09/sensors-19-03158-g004.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/f209/6679560/f42e615c7800/sensors-19-03158-g005.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/f209/6679560/72e874755e53/sensors-19-03158-g006.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/f209/6679560/a6d5ffed0d90/sensors-19-03158-g007.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/f209/6679560/78c26a0db97e/sensors-19-03158-g008.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/f209/6679560/30b4eff32136/sensors-19-03158-g001.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/f209/6679560/77a9b88a2da2/sensors-19-03158-g002.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/f209/6679560/11828660e02a/sensors-19-03158-g003.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/f209/6679560/6f07fb3d9a09/sensors-19-03158-g004.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/f209/6679560/f42e615c7800/sensors-19-03158-g005.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/f209/6679560/72e874755e53/sensors-19-03158-g006.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/f209/6679560/a6d5ffed0d90/sensors-19-03158-g007.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/f209/6679560/78c26a0db97e/sensors-19-03158-g008.jpg

相似文献

1
Using Greedy Random Adaptive Procedure to Solve the User Selection Problem in Mobile Crowdsourcing.使用贪婪随机自适应过程解决移动众包中的用户选择问题。
Sensors (Basel). 2019 Jul 18;19(14):3158. doi: 10.3390/s19143158.
2
Task Allocation Model Based on Worker Friend Relationship for Mobile Crowdsourcing.基于工人好友关系的移动众包任务分配模型。
Sensors (Basel). 2019 Feb 22;19(4):921. doi: 10.3390/s19040921.
3
Coverage-Balancing User Selection in Mobile Crowd Sensing with Budget Constraint.预算约束下移动人群感知中的覆盖平衡用户选择
Sensors (Basel). 2019 May 23;19(10):2371. doi: 10.3390/s19102371.
4
PUEGM: A Method of User Revenue Selection Based on a Publisher-User Evolutionary Game Model for Mobile Crowdsensing.PUEGM:一种基于发布者 - 用户演化博弈模型的移动众包用户收益选择方法
Sensors (Basel). 2019 Jul 2;19(13):2927. doi: 10.3390/s19132927.
5
Walrasian Equilibrium-Based Incentive Scheme for Mobile Crowdsourcing Fingerprint Localization.基于瓦尔拉斯均衡的移动众包指纹定位激励机制
Sensors (Basel). 2019 Jun 14;19(12):2693. doi: 10.3390/s19122693.
6
A Task-Centric Cooperative Sensing Scheme for Mobile Crowdsourcing Systems.一种面向移动众包系统的以任务为中心的协作感知方案。
Sensors (Basel). 2016 May 23;16(5):746. doi: 10.3390/s16050746.
7
An Incentive Mechanism in Mobile Crowdsourcing Based on Multi-Attribute Reverse Auctions.基于多属性逆向拍卖的移动众包中的激励机制。
Sensors (Basel). 2018 Oct 14;18(10):3453. doi: 10.3390/s18103453.
8
Mobility-Aware Privacy-Preserving Mobile Crowdsourcing.移动感知隐私保护的移动众包。
Sensors (Basel). 2021 Apr 2;21(7):2474. doi: 10.3390/s21072474.
9
Pick-up point recommendation strategy based on user incentive mechanism.基于用户激励机制的接送点推荐策略
PeerJ Comput Sci. 2023 Nov 20;9:e1692. doi: 10.7717/peerj-cs.1692. eCollection 2023.
10
Cost-Effective Edge Server Placement in Wireless Metropolitan Area Networks.无线城域网中的经济有效的边缘服务器放置。
Sensors (Basel). 2018 Dec 21;19(1):32. doi: 10.3390/s19010032.

引用本文的文献

1
Evaluation of combinatorial optimisation algorithms for c-optimal experimental designs with correlated observations.具有相关观测值的 c 最优实验设计的组合优化算法评估
Stat Comput. 2023;33(5):112. doi: 10.1007/s11222-023-10280-w. Epub 2023 Jul 29.

本文引用的文献

1
Maximizing Coverage Quality with Budget Constrained in Mobile Crowd-Sensing Network for Environmental Monitoring Applications.在环境监测应用的移动众包感知网络中,在预算受限的情况下最大化覆盖质量。
Sensors (Basel). 2019 May 26;19(10):2399. doi: 10.3390/s19102399.
2
Experimentation Management in the Co-Created Smart-City: Incentivization and Citizen Engagement.共创型智慧城市中的实验管理:激励措施与市民参与。
Sensors (Basel). 2019 Jan 20;19(2):411. doi: 10.3390/s19020411.
3
Managing Pervasive Sensing Campaigns via an Experimentation-as-a-Service Platform for Smart Cities.
通过智慧城市的实验即服务平台来管理普遍存在的感知活动。
Sensors (Basel). 2018 Jul 2;18(7):2125. doi: 10.3390/s18072125.
4
Scalable and Cost-Effective Assignment of Mobile Crowdsensing Tasks Based on Profiling Trends and Prediction: The ParticipAct Living Lab Experience.基于剖析趋势和预测的可扩展且具成本效益的移动众包感知任务分配:ParticipAct生活实验室经验
Sensors (Basel). 2015 Jul 30;15(8):18613-40. doi: 10.3390/s150818613.