Published on Tue Jun 01 2021

Low Complexity Recruitment for Collaborative Mobile Crowdsourcing Using Graph Neural Networks

Aymen Hamrouni, Hakim Ghazzai, Turki Alelyani, Yehia Massoud

Collaborative Mobile crowdsourcing (CMCS) allows entities to hire a team of workers from the crowd. We investigate two different CMCS recruitment strategies allowing task requesters to form teams of socially connected and skilled workers. We first formulate the recruitment as an Integer Linear Program that optimally forms teams according to four fuzzy-logic-based criteria.

1
0
0
Abstract

Collaborative Mobile crowdsourcing (CMCS) allows entities, e.g., local authorities or individuals, to hire a team of workers from the crowd of connected people, to execute complex tasks. In this paper, we investigate two different CMCS recruitment strategies allowing task requesters to form teams of socially connected and skilled workers: i) a platform-based strategy where the platform exploits its own knowledge about the workers to form a team and ii) a leader-based strategy where the platform designates a group leader that recruits its own suitable team given its own knowledge about its Social Network (SN) neighbors. We first formulate the recruitment as an Integer Linear Program (ILP) that optimally forms teams according to four fuzzy-logic-based criteria: level of expertise, social relationship strength, recruitment cost, and recruiter's confidence level. To cope with NP-hardness, we design a novel low-complexity CMCS recruitment approach relying on Graph Neural Networks (GNNs), specifically graph embedding and clustering techniques, to shrink the workers' search space and afterwards, exploiting a meta-heuristic genetic algorithm to select appropriate workers. Simulation results applied on a real-world dataset illustrate the performance of both proposed CMCS recruitment approaches. It is shown that our proposed low-complexity GNN-based recruitment algorithm achieves close performances to those of the baseline ILP with significant computational time saving and ability to operate on large-scale mobile crowdsourcing platforms. It is also shown that compared to the leader-based strategy, the platform-based strategy recruits a more skilled team but with lower SN relationships and higher cost.

Tue Aug 25 2020
Machine Learning
Auxiliary-task Based Deep Reinforcement Learning for Participant Selection Problem in Mobile Crowdsourcing
In mobile crowdsourcing (MCS), the platform selects participants to complete location-aware tasks from recruiters aiming to achieve multiple goals. Different MCS systems have different goals and there are possibly conflicting goals even in one MCS system. To deal with this issue, we formulate the participant selection
0
0
0
Wed Aug 12 2015
Machine Learning
Learning to Hire Teams
Recruiter needs to learn workers' skills and expertise by performing online tests and interviews. We present algorithms with PAC bounds on the required budget to hire a near-optimal team. We consider an embedding of the tasks and workers in an underlying graph that may arise from task similarities or social ties.
0
0
0
Wed May 10 2017
Machine Learning
Context-Aware Hierarchical Online Learning for Performance Maximization in Mobile Crowdsourcing
In mobile crowdsourcing (MCS), mobile users accomplish outsourced human intelligence tasks. MCS requires an appropriate task assignment strategy, since different workers may have different performance in terms of acceptance rate and quality. In this paper, we propose a context-aware hierarchical online learning algorithm.
0
0
0
Thu Aug 19 2021
Computer Vision
Wisdom of (Binned) Crowds: A Bayesian Stratification Paradigm for Crowd Counting
Datasets for training crowd counting deep networks are typically heavy-tailed and exhibit discontinuities across the count range. To enable principled and balanced minibatch sampling, we propose a novel smoothed Bayesian sample stratification approach.
2
0
0
Fri Jan 31 2020
Computer Vision
Hybrid Graph Neural Networks for Crowd Counting
Crowd counting is an important yet challenging task due to the large scale and density variation. Recent investigations have shown that distilling rich relations among multi-scale features and exploiting useful information from the auxiliary task are vital for this task. In this paper, we present a novel network structure called Hybrid
0
0
0
Thu Apr 25 2019
Machine Learning
Gradient Descent for Sparse Rank-One Matrix Completion for Crowd-Sourced Aggregation of Sparsely Interacting Workers
We consider worker skill estimation for the single-coin Dawid-Skene crowdsourcing model. In practice, skill-estimation is challenging because worker assignments are sparse and irregular. We formulate skill estimation as a rank-one correlation-matrix completion problem.
0
0
0
Thu Jan 03 2019
Machine Learning
A Comprehensive Survey on Graph Neural Networks
Deep learning has revolutionized many machine learning tasks in recent years. Data in these tasks are typically represented in the Euclidean space. However, there is an increasing number of applications where data is generated from non-Euclidean domains.
3
3
15
Tue Dec 11 2018
Machine Learning
Deep Learning on Graphs: A Survey
Deep learning has been shown to be successful in a number of domains, ranging from acoustics, images, to natural language processing. applying deep learning to the ubiquitous graph data is non-trivial because of the unique characteristics of graphs.
1
7
5
Mon Jul 17 2017
Artificial Intelligence
graph2vec: Learning Distributed Representations of Graphs
Many graph analytics tasks require representing entire graphs as fixed length feature vectors. graph2vec'sembeddings are learnt in an unsupervised manner and are task agnostic. They could be used for any downstream task such as graph classification.
1
3
4
Thu Dec 20 2018
Machine Learning
Graph Neural Networks: A Review of Methods and Applications
Graph neural networks (GNNs) are neural models that capture the dependence ofcertaingraphs via message passing between the nodes of graphs. In recent years,variants of GNNs such as graph convolutional network (GCN), graph attention network (GAT), graph recurrent
2
0
1
Mon Nov 09 2020
Machine Learning
BayGo: Joint Bayesian Learning and Information-Aware Graph Optimization
This article deals with the problem of distributed machine learning. Agents update their models based on their local datasets, and aggregate the updated models collaboratively. The proposed alternating minimization based framework ensures global connectivity in a fully decentralized way.
0
0
0
Tue Apr 28 2020
Machine Learning
A Photo-Based Mobile Crowdsourcing Framework for Event Reporting
Mobile Crowdsourcing (MCS) photo-based is an arising field of interest and a trending topic in the domain of ubiquitous computing. The built-in cameras of mobile devices are becoming the most common way for visual logging techniques in our daily lives.
0
0
0