IEEE Internet of Things Journal · 2020 · 46 citations · 44 references
ComputingComputer SystemsAutomationMachine LearningMobile SystemsAssignment ProblemsTask SchedulingCoverageCoverage Task AllocationCrowdsensingMatchingMobile CrowdsensingOperational Cost AnalysisTask AssignmentTask Assignment Learning
Crowdsensing tasks are usually described by certain features or attributes, and the task assignment essentially performs a matching with respect to the worker or user's preference on these features. However, the existing matching strategy could lead to a misaligned task coverage problem, i.e., some popular tasks tend to enter workers' candidate task lists, while some less popular tasks could be always unsuccessfully assigned. To ensure task coverage after the assignment, the system may have to increase their biding costs to reassign such tasks, which causes a high operational cost of the crowdsensing system. To address this problem, we propose to migrate certain qualified workers to the less popular tasks for increasing the task coverage and meanwhile, optimize other performance factors. By doing this, other performance factors, such as task acceptance and quality, can be comparably achieved as recent designs, while the system cost can be largely reduced. Following this idea, this article presents cTaskMat, which learns and exploits workers' task preferences to achieve coverage-ensured task assignments. We implement the cTaskMat design and evaluate its performance using both real-world experiments and data set-driven evaluations, also with the comparison with the state-of-the-art designs.
44
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · 2023 · 76.3K citations · Full text
Item-based collaborative filtering recommendation algorithms
Badrul Sarwar, George Karypis, Joseph A. Konstan et al. · 2001 · 9K citations
BPR: Bayesian Personalized Ranking from Implicit Feedback
Steffen Rendle, Christoph Freudenthaler, Zeno Gantner et al. · arXiv (Cornell University) · 2012 · 4.4K citations · Full text