Recommendation of Crowdsourcing Tasks Based on Word2vec Semantic Tags

Abstract

Crowdsourcing is the perfect show of collective intelligence, and the key of finishing perfectly the crowdsourcing task is to allocate the appropriate task to the appropriate worker. Now the most of crowdsourcing platforms select tasks through tasks search, but it is short of individual recommendation of tasks. Tag-semantic task recommendation model based on deep learning is proposed in the paper. In this paper, the similarity of word vectors is computed, and the semantic tags similar matrix database is established based on the Word2vec deep learning. The task recommending model is established based on semantic tags to achieve the individual recommendation of crowdsourcing tasks. Through computing the similarity of tags, the relevance between task and worker is obtained, which improves the robustness of task recommendation. Through conducting comparison experiments on Tianpeng web dataset, the effectiveness and applicability of the proposed model are verified.

Full text

Research Article
Recommendation of Crowdsourcing Tasks Based on
Word2vec Semantic Tags
Qingxian Pan ,1,2 Hongbin Dong ,1Yingjie Wang,2Zhipeng Cai ,3and Lizong Zhang4
1College of Computer Science and Technology, Harbin Engineering University, Harbin 150001, China
2School of Computer and Control Engineering, Yantai University, Yantai 264005, China
3Department of Computer Science, Georgia State University, Atlanta, GA 30303, USA
4School of Computer Science and Engineering, University of Electronic Science and Technology of China, Chengdu 611731, China
Correspondence should be addressed to Hongbin Dong; donghongbin@hrbeu.edu.cn
Received 1 November 2018; Revised 18 February 2019; Accepted 3 March 2019; Published 24 March 2019
Guest Editor: Michele Nogueira
Copyright ©  Qingxian Pan et al. is is an open access article distributed under the Creative Commons Attribution License,
which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Crowdsourcing is the perfect show of collective intelligence, and the key of nishing perfectly the crowdsourcing task is to allocate
the appropriate task to the appropriate worker. Now the most of crowdsourcing platforms select tasks through tasks search, but it is
short of individual recommendation of tasks. Tag-semantic task recommendation model based on deep learning is proposed in the
paper. In this paper, the similarity of word vectors is computed, and the semantic tags similar matrix database is established based
on the Wordvec deep learning. e task recommending model is established based on semantic tags to achieve the individual
recommendation of crowdsourcing tasks. rough computing the similarity of tags, the relevance between task and worker is
obtained, which improves the robustness of task recommendation. rough conducting comparison experiments on Tianpeng
web dataset, the eectiveness and applicability of the proposed model are veried.
1. Introduction
Deep learning was proposed by Georey Hinton et al. in
. is method simulates human brain neural network to
model and realize multiple level abstraction [, ]. In ,
Je Howe of American Wired magazine reporter proposed
crowdsourcing concept []. As a new kind of business model,
crowdsourcing has been widespread concern in various elds
and becomes the new hot point of computer research elds.
Task requester, crowdsourcing platform, and worker make
up crowdsourcing system []. e process of crowdsourc-
ing includes designing task, publishing task, selecting task,
sensing task, submitting solution, and integrating solution.
Among them, task selection is the key phase in the process
ofcrowdsourcing.isisthekeytocompletecrowdsourcing
task that the appropriate worker selects appropriate task in
appropriate time [].
e popular crowdsourcing platforms use task searching
to get the favourite task by keyword searching []. However,
with the rapid development of crowdsourcing, the problem of
information overload is more and more serious. In addition,
it is more and more dicult to get the favourite crowdsourc-
ing task for worker. Recommender system is an eective
medium to solve the problem, which is used on many E-
Commerce Platforms, such as Alibaba, Amazon, and Netix
[]. But there are many problems which are not solved in rec-
ommender systems, such as similarity calculation, the lower
recommended accuracy, data sparseness, and cold boot. In
brief, improving the accuracy and reliability of recommender
systems has been paid more attention by scholars.
However, individual recommendation research of the
task is lesser in crowdsourcing, and task selection is relied
on hobbies and expertise. Few crowdsourcing platforms can
actively recommend task. is paper researches the crowd-
sourcing tasks recommendation model based on Wordvec
semantic tags in order to achieve individual recommendation
of crowdsourcing tasks [].
e main contributions of this paper include following
three contents:
Hindawi
Wireless Communications and Mobile Computing
Volume 2019, Article ID 2121850, 10 pages
https://doi.org/10.1155/2019/2121850

 Wireless Communications and Mobile Computing
Platform-Server
Tas k D esig n
Task Publishing
Receive Answer
Finishing Answer
Requester
Workers
Task Selection
Task Reception
Task Solution
Answer Submission
F : e workow of crowdsourcing.
() Compute the similarity of word vectors and build the
semantic tags similar matrix database based on the
Wordvec deep learning.
() Research the task recommending model based on
semantic tags to achieve the individual recommen-
dation of crowdsourcing tasks. is paper computes
similarityoftasksandworkersbasedonthesemantic
tag similar matrix.
() Utilizing the Tianpeng Web dataset, the experiments
are conducted. e experimental results show that the
model is feasible and eective. e model can be used
in other elds according to the dierent semantic
databases.
ispaperisorganizedasfollows.Sectionreviewsthe
related works. e Workvec is discussed in Section . In
addition, the tasks recommendation model and realization
method based on semantic tags are researched in Section .
e comparison experiments, as well as the analysis for
the experimental results, are introduced in Section . e
conclusion is presented in Section .
2. Related Works
In order to discuss the related works for recommendation of
crowdsourcing, we, respectively, introduce the related works
of crowdsourcing and recommendations.
2.1. Crowdsourcing. In , Je Howe proposed crowd-
sourcing concept rstly []: a company or an institution
outsources the tasks performed by an employee in the past to
an unspecic public network in a free and voluntary manner.
With the development of crowdsourcing technology, the
dierent crowdsourcing concepts appeared. Chen et al. []
summarized  dierent crowdsourcing denitions. Feng et
al. [] gave the denition of crowdsourcing according to the
basic features of crowdsourcing. According to the denition,
crowdsourcing is a distributed problem-solving mechanism
opening to the Internet public, and it completes the tasks
that are dicult to complete by a computer through inte-
grating computers and the unknown public on the Internet
[].
Crowdsourcing is successfully applied in language trans-
lation, image recognition, intelligent transportation, soware
development, entry interpretation, tourism photography, and
other elds, which has become the perfect embodiment
of group wisdom [, ]. Crowdsourcing is made up of
the task requester, crowdsourcing platform, and workers.
e crowdsourcing workow includes designing tasks by
task requester, publishing tasks, selecting tasks by workers,
solving tasks, submitting answer, and arranging answer. e
workow of crowdsourcing is shown by Figure . e public
participation is the basis of crowdsourcing. And the key to
high-quality complete crowdsourcing tasks is to recommend
appropriate tasks to appropriate worker in appropriate time
[].
2.2. Recommender Systems. With the arrival of big data era,
the problem of information overload is more and more
serious and that nding the useful and best information
is more and more dicult. Recommender Systems is an
eective medium to solve the above problems []. However,
there are some inherent defects in recommendation systems,
such as low accuracy, data sparseness, cold boot, the defects
of the centralized system, similarity calculation, and being
easy to be attacked. In addition, many recommender sys-
temsappliedtobusinesssystems,whosepurposeistosell
more goods and seek the maximum benets, rather than
to recommend the best commodities to users. In brief, the
credibility and accuracy of recommendation systems need to
be improved, which has attracted the attention of scholars.
Yang et al. [] proposed a recommender system based on
transfer learning. Chen et al. [] proposed a recommender
system based on bind context. Tang et al. [] researched
recommender system based on crossing knowledge. Liu
[] and Zhou et al. [] researched recommender systems
for social recommendation. Combining Markov and social
attributes of users, Wang et al. [] proposed a probability-
based recommendation model to recommend items for
users.

Wireless Communications and Mobile Computing 
Input Projection Output
w(t-2)
w(t-1)
w(t+1)
w(t+2)
w(t)
SUM
(a) CBOW model
Input Projection Output
w(t-2)
w(t-1)
w(t+1)
w(t+2)
w(t)
(b) Skip-gram model
F : CBOW model and Skip-gram model.
Crowdsourcingtaskrecommendationismainlyfrom
the perspective of crowdsourcing platform. Based on the
task discovery model, crowdsourcing platform recommends
related tasks according to the preferences of workers []. e
main crowdsourcing platforms basically adopt the way of task
search and rarely adopt the method of task recommendation
[]. Some task recommendation methods were researched
based on traditional recommendation methods, including
content-based recommendation, collaborative ltering, and
mixed recommendation algorithms. Ambati et al. [] pro-
posed the use of task and workers' historical information for
task recommendation. Yuen et al. [] proposed a worker-
task recommendation model through combining the histori-
cal information of workers and browsing history. Deng et al.
[] researched the problem of maximizing task selection for
spatiotemporal tasks.
3. Word2vec
In , Bengio et al. [] proposed Neural Network Lan-
guage Model-NNLM based on  levels. NNLM is used to
compute the probability (𝑡=  | ) of the next
word 𝑡of a context, and word vector is the byproduct
during training. Wordvec is a tool based on deep learning
to compute the similarity of word vector which was proposed
by Google company in  []. It converts the word into
word vector and computes similarity according to the cosine
betweenwordvectors.Whenusingthetool,thetextsaer
segmentation are input, and the output-word vector can be
used to do a lot of Natural Language Processing (NLP) related
work, such as clustering, looking for synonyms, and part of
speech analysis.
Wordvec uses word vector presentation mode based
on Distributed representation. Distributed representation is
proposed by Hinton in  []. Its basic thought is to map
each word into a -dimension real vector by training (is
a hyperparameter in the model) and to judge the semantic
similarity between them according to the distance between
words (such as cosine similarity, Euclidean distance). It uses
a ‘ layers neural network’, input layer-hidden layer-output
layer. Its core technology is to use Human code according to
word frequency, which makes the activated content basically
consistent of all word frequency similar words in hidden
layer. e higher the frequency of the word, the less the
number of hidden layers they activate, which eectively
reduces the computational complexity.
Compared with Latent Semantic Index-LSI and Latent
Dirichlet Allocation-LDA, Wordvec uses the context of
words and makes the semantic information richer. ere are
two kinds of training model-CBOW (Continuous Bag-of-
Words) and Skip-gram in Wordvec, which are shown by
Figure . Two models both include input layer, projection
layer, and output layer. CBOW model predicts the current
wordsaccordingtotheknowncontext,andSkip-grammodel
predicts context according to the current words.
In this paper, the objective optimization function of
CBOW is expressed by
(|())=𝑙𝑤

𝑗=2𝑤
𝑗|𝑤,𝑤
𝑗−1()
where 𝑤means the word vector of the root node in the
Homan tree, ()represents the context of word ,
that is, the collection of peripheral words, 𝑤represents the
nodes number of the path 𝑤,and𝑤
𝑗∈ {0,1}represents
Human code of the word ;𝑤
1,𝑤
2,...,𝑤
𝑗−1 ∈𝑚represents
the vectors corresponding to nonleaf nodes of the path 𝑤.
erefore, the logistic regression probability (𝑤
𝑗|𝑤,𝑤
𝑗−1)
that passes a node intheHomantreeisshownby().
e corresponding parameter (𝑇
𝑤𝑤
𝑗−1)is shown by ().
𝑤
𝑗|𝑤,𝑤
𝑗−1=

𝑇
𝑤𝑤
𝑗−1, 𝑤
𝑗=0;
1−𝑇
𝑤𝑤
𝑗−1, 𝑤
𝑗=1. ()
𝑇
𝑤𝑤
𝑗−1= 1
1+−𝑥𝑇
𝑤𝜃𝑤
𝑗−1 ()

 Wireless Communications and Mobile Computing
In order to clearly represent the meaning of logistic regression
probability (𝑤
𝑗|𝑤,𝑤
𝑗−1), we combine () and () to obtain
the value of (𝑤
𝑗|𝑤,𝑤
𝑗−1),whichisshownby
𝑤
𝑗|𝑤,𝑤
𝑗−1=𝑇
𝑤𝑤
𝑗−11−𝑑𝑤
𝑗
⋅1−𝑇
𝑤𝑤
𝑗−1𝑑𝑤
𝑗
()
For avoiding the value of ( | ())too small, log-
arithm Likelihood function is used to represent the objective
function; thus, () can be converted into
=
𝑤∈𝐶
log (|()) ()
rough combining () and (), the objective function is
shown by

=
𝑤∈𝐶
log
𝑙𝑤

𝑗=2 𝑇
𝑤𝑤
𝑗−11−𝑑𝑤
𝑗⋅1
−𝑇
𝑤𝑤
𝑗−1𝑑𝑤
𝑗
=
𝑤∈𝐶
𝑙𝑤

𝑗=2 1−𝑤
𝑗⋅log 𝑇
𝑤𝑤
𝑗−1+𝑤
𝑗⋅log 1−𝑇
𝑤𝑤
𝑗−1
()
erefore, () is the object function of CBOW in this paper.
Wordvec uses random gradient ascent method to optimize
the object function of CBOW.
4. The Tasks Recommendation Model and
Realization Method Based on Semantic Tags
4.1. Basic Model Frame and Mathematical Computation
Model. e results and discussion may be presented sepa-
rately, or in one combined section, and may optionally be
divided into headed subsections.
e core of the model is the research of tag similar matrix.
e model uses tag similar matrix to compute the similarity
of workers and tasks, produces worker-tag similar matrix,
and realizes tasks recommendation or workers recommenda-
tion.Inmodel,tagsimilarmatrixisobtainedbyWordvec
computing. Worker-tag matrix is got according to history
work information of the worker, registration information, etc.
And task-tag matrix is got according to task description, task
classication, etc.
Dene tag similar matrix ∈
𝑚×𝑚,𝑙11 ⋅⋅⋅ 𝑙1𝑚
.
.
.d.
.
.
𝑙𝑚1 ⋅⋅⋅ 𝑙𝑚𝑚 ,
is a symmetric matrix, that is, 𝑖𝑗 =
𝑗𝑖,𝑖𝑗 represents the
similarity of tag and tag ,𝑖𝑗 ∈[0,1],anditsvalueisgot
through using Wordvec tool to compute. Dene worker-tag
matrix ∈
𝑛×𝑚,𝑤11 ⋅⋅⋅ 𝑤1𝑚
.
.
.d.
.
.
𝑤𝑛1 ⋅⋅⋅ 𝑤𝑛𝑚 ,and,amongthem, 𝑖𝑗 =
{1, worker has tag ; 0, worker has not tag }.
We dene the task-tag matrix ∈
𝑝×𝑚,
𝑡11 ⋅⋅⋅ 𝑡1𝑚
.
.
.d.
.
.
𝑡𝑝1 ⋅⋅⋅ 𝑡𝑝𝑚 ,and,amongthem, 𝑖𝑗 ={1,task has tag ; 0,
task has not tag }.
erefore, the worker-task similar matrix 𝑇is obtained
by (), where is the worker-tag matrix, is the tag
similar matrix, and 𝑇means the task-tag transposed matrix.
rough (), the relationship between workers and tasks can
be obtained.
𝑇=××𝑇
=




11 ⋅⋅⋅ 1𝑚
...d...
𝑛1 ⋅⋅⋅ 𝑛𝑚




×




11 ⋅⋅⋅ 1𝑚
...d...
𝑚1 ⋅⋅⋅ 𝑚𝑚





×




11 ⋅⋅⋅ 1𝑚
...d...
𝑝1 ⋅⋅⋅ 𝑝𝑚





𝑇
()
4.2. Basic Flow. e main steps of the process of the proposed
recommendation model are shown as follows: () compute
the word vectors based on Wordvec; () computing the
similarity of word vectors; () generating the tag similar
matrix; () obtaining the worker-tag matrix and task-tag
matrix; () computing the worker-task similarity matrix;
() 2standardization and normalization; () tasks and
workers recommendation. Tag similar matrix generation
uses Wordvec tool. Worker-task similarity computation uses
mathematical methods introduced in the previous section.
e section mainly introduces standardization and normal-
ization method.
2standardization method: the 2norm denition of
vector (1,2,...,𝑛)is shown as follows: () =
2
1+2
2+⋅⋅⋅+2
𝑛.
In order to make normalized to the unit 2norm, the
mapping between and 󸀠is established, so that the 2norm
of 󸀠is , and the proof is shown as follows:
1=󸀠=2
1+2
2+⋅⋅⋅+2
𝑛
()
=󸀠2
1+󸀠2
2+⋅⋅⋅+󸀠2
𝑛
=1
()2+ 2
()2+⋅⋅⋅+ 𝑛
()2
()
where the value of 󸀠
𝑖is shown by
󸀠
𝑖=𝑖
()()
In order to get the standardization and generality of data, the
standardization data of 2is normalized, so that the data fall
in the interval [0,1], the conversion formula is shown by (),
where min()means the minimum in ,andmax()is the
maximum in .
󸀠
𝑖=𝑖−min ()
max ()−min ()()

Wireless Communications and Mobile Computing 
T : Wordvec parameter setting.
Parameter Value Parameter Value
window  hs 
size  cbow yes
threads  alpha .
binary  negative 
T : Tag similar matrix L of simulation dataset.
L L L L L L L ...
L . . . . . . . ...
L . . . . . . . ...
L . . . . . . . ...
L . . . . . . . ...
L . . . . . . . ...
L . . . . . . . ...
L . . . . . . . ...
... ... ... ... ... ... ... ... ...
T:Worker-tagmatrixW.
L L L L L L L L L L L ...
W   ...
W  ...
W            ...
W   ...
W  ...
... ... ... ... ... ... ... ... ... ... ... ... ...
5. Experiment and Simulation
In this section, we conduct the comparison experiments on
the simulation dataset and real dataset, respectively. e real
dataset is the dataset crawled from Tianpeng web site.
In the experiment, text is corpora training set, and
experimental environment is Intel Core (TM) i-U CPU
@.GHz dual-core, and GB memory.
5.1. e Experiments Conducted on Simulation Dataset. In
this group of comparison experiments, the training param-
eters are shown in Table .
In addition, the tag similar matrix aer training is shown
in Table . In the matrix, the elements indicate the similarities
between tags.
In this group of experiments, there are  workers, 
tasks,  tags in the experiment. e worker-tag matrix is
generated randomly, which is shown in Table . e elements
in Table  represent the similarities between workers and tags.
e task-tag matrix is shown in Table . e elements in
Table  indicate the similarities between tasks and tags. Aer
computing the worker-task matrix, the standardization and
normalization of worker-task matrix are shown in Table .
e elements in Table  mean the similarities between
workers and tasks.
T:Task-tagmatrixT.
L L L L L L L L L L L ...
T   ...
T            ...
T  ...
T   ...
T   ...
... ... ... ... ... ... ... ... ... ... ... ... ...
T : Worker-task similar matrix.
T T T T T T T ...
U . . . . . . . ...
U . . . . . . . ...
U . . . . . . . ...
U . . . . . . . ...
U . . . . . . . ...
... ... ... ... ... ... ... ... ...
Recall, precision, and F-measure are commonly used
evaluation indexes []. e computing methods for the three
evaluationindexesareshownby(),(),and().According
to (), (), and (), it can be seen that F-measure index is
the comprehensive measure index through considering both
recall and precision.
Recall
=the quantity of related information retrieved
the quantity of related information in system
()
Precision
=the quantity of related information retrieved
the quantity of all information retrieved
()
F-measure =2×Precision ×Pecall
Precision +Recall ()
ethresholdvaluesare.,.,and.,respectively,
and the recall, precision, and F-measure of the  tasks are
obtained. e comparison experimental results on recall,
precision, and F-measure indexes are shown by Figures ,
, and , respectively. In these experiments, x-coordinate
indicates the Task-tag matrix T, and y-coordinates are recall
rate, precision rate, and F-measure rate, respectively. From
the experimental results, it can be seen that threshold=. has
better performance than other two thresholds comprehen-
sively.
In addition, we compare the proposed method with the
method of tasks research. e experimental result is shown in
Figure , where x-coordinate indicates the Task-tag matrix T
andy-coordinatemeansthenumberofworkers.emethod
used in this paper is better than the method used in tasks
research, which proves the eectiveness of the method of
this paper. In addition, the potential workers can be found

 Wireless Communications and Mobile Computing
T:TagsimilarmatrixLofTianpengdataset.
L L L L L L L L L L L L L ...
L . . -. . . . . -. -. -. -. . -. ...
L . . . . . . . . . . . . . ...
L -. . . . . . . . . . . . . ...
L . . . . . . . . . . . . . ...
L . . . . . . . . . . . . . ...
L . . . . . . . . . . . . . ...
L . . . . . . . . . . . . . ...
L -. . . . . . . . . . . . . ...
L -. . . . . . . . . . . . . ...
L -. . . . . . . . . . . . . ...
L -. . . . . . . . . . . . . ...
L . . . . . . . . . . . . . ...
L -. . . . . . . . . . . . . ...
... ... ... ... ... ... ... ... ... ... ... ... ... ... ...
0
0.1
0.2
0.3
0.4
0.5
0.6
0.7
0.8
T1 T2 T3 T4 T5 T6 T7 T8 T9 T10 T11 T12 T13 T14 T15 T16 T17 T18 T19 T20 T21 T22 T23 T24 T25 T26 T27 T28 T29 T30 T31 T32 T33 T34 T35 T36 T37 T38 T39 T40T41 T42 T43 T44 T45 T46 T47 T48 T49 T50
threshold=0.55
threshold=0.6
threshold=0.65
F : Recall of dierent thresholds.
by lowering the threshold, which can be used to analyze the
potential users.
5.2. e Experiments Conducted on Tianpeng Dataset. e
datacollectedfromtheTianpengwebsitewerecollectedto
form a corpus for training, and the tag similarity matrix was
obtained as shown in the Table .
We sele c t    w o r k e r s a n d    t a s k s f rom Ti anpeng
dataset as experimental objects. Utilizing the dataset, we con-
duct the comparison experiments to verify the eectiveness
of the proposed model. In the comparison experiments, .
istakenasthethreshold,andtasksarerandomlyselected
as recommended objects. e experimental results were
compared with binary map matching and greedy algorithm
in terms of recall rate, accuracy rate, and F-value measure
indexes.
According to the recall measure index, the comparison
experimental result is shown by Figure . e x-coordinate
indicates the Task-tag matrix T, and y-coordinate presents
the recall rate. From the experimental result, it can be
seen that the proposed recommendation model has the best
performance on recall rate through compared with greedy
algorithm and bipartite graph matching. In addition, the
proposed recommendation model has better stability with the
changing of T.
Figure  shows the experimental result on precision rate.
Similarly, the x-coordinate indicates the Task-tag matrix T,
and y-coordinate means the precision rate. In experimental

Wireless Communications and Mobile Computing 
0
0.1
0.2
0.3
0.4
0.5
0.6
0.7
T1 T2 T3 T4 T5 T6 T7 T8 T9 T10 T11 T12 T13 T14 T15 T16 T17 T18 T19 T20 T21 T22 T23 T24 T25 T26 T27 T28 T29 T30 T31 T32 T33 T34 T35T36 T37 T38 T39 T40 T41 T42 T43 T44 T45 T46 T47 T48 T49 T50
threshold=0.55
threshold=0.6
threshold=0.65
F : Precision of dierent thresholds.
0
0.1
0.2
0.3
0.4
0.5
0.6
T1 T2 T3 T4 T5 T6 T7 T8 T9 T10 T11 T12 T13 T14 T15 T16 T17 T18 T19 T20 T21 T22 T23 T24 T25 T26 T27 T28 T29 T30 T31 T32 T33 T34 T35 T36 T37 T38T39 T40 T41 T42 T43 T44 T45 T46 T47 T48 T49 T50
threshold=0.55
threshold=0.6
threshold=0.65
F : F-measure of dierent thresholds.
result, the average precision rate of the proposed recommen-
dation is better than other two algorithms. From Figure ,
it can be seen that the proposed recommendation has the
best performance on precision rate through compared with
greedy algorithm and bipartite graph matching.
According to the experimental result on F-measure
shownbyFigure,wecanseethattheproposedrecommen-
dation also has the best performance on F-measure. In addi-
tion, F-measure index is the comprehensive measure index
through considering both recall and precision. erefore, we
can infer that the proposed recommendation has the best
performance through compared with greedy algorithm and
bipartite graph matching algorithm.
rough the comparison shows that the proposed meth-
ods than the binary map matching method, greedy algorithm
intherecall,F-measureindexsignicantly,intermsof
accuracy with high and low, because to make the task would
be able to complete the task of recommended for workers
as much as possible, including the potential of workers, so
the accuracy index can be put lower in the recommended
requirements. It can be seen that the method proposed in this
paper has higher practical signicance and application value.

 Wireless Communications and Mobile Computing
0
5
10
15
20
25
30
35
40
45
50
T1 T2 T3 T4 T5 T6 T7 T8 T9 T10 T11 T12 T13 T14 T15 T16 T17 T18 T19 T20 T21 T22 T23 T24 T25 T26 T27 T28 T29 T30 T31 T32 T33 T34 T35 T36 T37 T38 T39 T40T41 T42 T43 T44 T45 T46 T47 T48 T49 T50
this paper
tasks research
F : Comparison of experimental results.
0.2
0.3
0.4
0.5
0.6
0.7
0.8
0.9
1
T1 T2 T3 T4 T5 T6 T7 T8 T9 T10 T11 T12 T13 T14 T15 T16 T17 T18 T19 T20
this paper
greedy algorithm
bipartite graph matching
F : Recall of dierent methods.
6. Conclusion
Crowdsourcing is the prefect shown of group wisdom. It
was applied in many elds as a new business model. In
recent years, it has become the new hot research in computer
science. e success key of crowdsourcing is to recommend
task to appropriate worker. e recommendation method
based on tag similar matrix is proposed in this paper. e
method uses Wordvec technology to generate tag similar
matrixandthencomputesthesimilarityofworkerandtask.
According to the comparison experiments, it proves that
themethodiseectiveandfeasible.erecommendation
method can be extended to other elds with the dierent
corpora.
Because the success key of crowdsourcing is the partic-
ipate rate of workers, it has become a hot topic in crowd-
sourcing research, such as reputation mechanism, prefer-
ence evolution, and privacy protection of workers. It will
be the focus of future research to improve the accuracy
of recommender systems by combining recommender sys-
tems with reputation, preference evolution and historical
information.

Wireless Communications and Mobile Computing 
0.2
0.3
0.4
0.5
0.6
0.7
0.8
0.9
1
T1 T2 T3 T4 T5 T6 T7 T8 T9 T10 T11 T12 T13 T14 T15 T16 T17 T18 T19 T20
this paper
greedy algorithm
bipartite graph matching
F : Precision of dierent methods.
0.2
0.3
0.4
0.5
0.6
0.7
0.8
0.9
1
T1 T2 T3 T4 T5 T6 T7 T8 T9 T10 T11 T12 T13 T14 T15 T16 T17 T18 T19 T20
this paper
greedy algorithm
bipartite graph matching
F : F-measure of dierent methods.
Data Availability
e [Tianpeng] dataset used to support the ndings of this
study are available from the corresponding author upon
request.
Conflicts of Interest
e authors declare that there are no conicts of interest
regarding the publication of this paper.
Acknowledgments
isworkissupportedbytheNationalNaturalScienceFoun-
dation of China under Grants No. , No. ,
and No. , the China Postdoctoral Science Founda-
tion under Grant No. M, the National Science
Foundation (NSF) under Grants No. , No. ,
and No. , and the Natural Science Foundation of
Sichuan Province under Grant No. HH.
References
[] Y. Cun, Y. Bengio, and G. Hinton, “Deep learning,” Nature,vol.
,no.,pp.–,.
[] Y. Wang, Z. Cai, G. Yin, Y. Gao, X. Tong, and G. Wu,
“An incentive mechanism with privacy protection in mobile
crowdsourcing systems,” Computer Networks,vol.,pp.–
, .
[] J. Howe, “e rise of crowdsourcing,” Wired Magazine ,vol.,
no. , pp. –, .
[] Z. Cai and X. Zheng, “A private and ecient mechanism for data
uploading in smart cyber-physical systems,” IEEE Transactions
on Network Science and Engineering,p.,.
[] Y.Hu,Y.Wang,Y.Li,andX.Tong,“Anincentivemechanism
based on multi-attribute reverse auction in mobile crowdsourc-
ing,” Sensors, vol. , no. , p. , .

 Wireless Communications and Mobile Computing
[]J.Li,Z.Cai,J.Wang,M.Han,andY.Li,“Truthfulincen-
tive mechanisms for geographical position conicting mobile
crowdsensing systems,” IEEE Transactions on Computational
Social Systems,vol.,no.,pp.–,.
[] R. Katarya and O. P. Verma, “Recent developments in aective
recommender systems,” Physica A: Statistical Mechanics and its
Applications,vol.,pp.–,.
[] K. W. Church, “Emerging trends: WordVec,” Natural Language
Engineering,vol.,no.,pp.–,.
[] X. Chen, P. N. Bennett, K. Collins-ompson, and E. Horvitz,
“Pairwise ranking aggregation in a crowdsourced setting,” in
Proceedings of the Sixth ACM International Conference,pp.–
,Rome,Italy,Feburary.
[] J. Feng, G. Li, and J. Feng, “A sur vey on crowdsourcing,” Chinese
Journal of Computers, vol. , pp. –, .
[] Z. Duan, W. Li, and Z. Cai, “Distributed auctions for task
assignment and scheduling in mobile crowdsensing systems,”
in Proceedings of the 2017 IEEE 37th International Conference
on Distributed Computing Systems (ICDCS), pp. –, GA,
USA, June .
[] Y.Wang,Z.Cai,X.Tong,Y.Gao,andG.Yin,“Truthfulincentive
mechanism with location privacy-preserving for mobile crowd-
sourcing systems,” Computer Networks,vol.,pp.–,.
[] Y.Wang,Y.Li,Z.Chi,andX.Tong,“etruthfulevolutionand
incentive for large-scale mobile crowd sensing networks,” IEEE
Access,vol.,pp.–,.
[] J. L. Cai, M. Yan, and Y. Li, “Using crowdsourced data in
location-based social networks to explore inuence maximiza-
tion,” in Proceedings of the 35th Annual IEEE International
Conference on Computer Communications,.
[] P. Resnick and H. R. Varian, “Recommender systems,” Commu-
nications of the ACM,vol.,no.,pp.–,.
[] W. Pan and Q. Yang, “Transfer learning in heterogeneous
collaborative ltering domains,” Artificial Intelligence,vol.,
pp.–,.
[] G. Chen and L. Chen, “Recommendation based on contextual
opinions,” UMAP 2014, LNCS 8538,pp.–,.
[] L. Liu, J. Tang, J. Han, and S. Yang, “Learning inuence from
heterogeneous social networks,” Data Mining and Knowledge
Discovery,vol.,no.,pp.–,.
[] J. Tang, X. Hu, and H. Liu, “Social recommendation: a review,”
Social Network Analysis and Mining, vol. , no. , pp. –,
.
[] L. L¨
u,M.Medo,C.H.Yeung,Y.Zhang,Z.Zhang,andT.Zhou,
“Recommender systems,” Physics Reports,vol.,no.,pp.–
, .
[] Y.Wang,G.Yin,Z.Cai,Y.Dong,andH.Dong,“Atrust-based
probabilistic recommendation model for social networks,” Jour-
nalofNetworkandComputerApplications,vol.,pp.–,
.
[] L. Zhang, Z. Cai, and X. Wang, “FakeMask: a novel privacy
preserving approach for smartphones,” IEEE Transactions on
Network and Service Management,vol.,no.,pp.–,
.
[] V.Ambati,S.Vogel,andJ.Carbonell,“Towardstaskrecommen-
dation in micro-task markets,” in Proceedings of the 25th AAAI
Workshop in Human Computation,pp.–,CA,USA,.
[]M.C.Yuen,I.King,andK.S.Leung,“Probabilisticmatrix
factorization in task recommendation in crowdsourcing sys-
tems,” in Proceedings of the 19th International Conference on
Neural Information Processing, pp. –, Springer, Doha,
Qatar, .
[] D. Deng, C. Shahabi, and U. Demiryurek, “Maximizing the
number of worker’s self-selected tasks in spatial crowdsourc-
ing,” in Proceedings of the 21st ACM SIGSPATIAL International
Conference,pp. –, FL, USA, November .
[
] J.Turian,L.Ratinov,andY.Bengio,“Wordrepresentations:a
simple and general method for semi-supervised learning,” in
Proceedings of the 8th Annual Meeting of the Association for
Computational Linguistics, pp. –, Uppsala, Sweden, July
.
[] Y. Yao, X. Li, X. Liu et al., “Sensing spatial distribution of
urban land use by integrating points-of-interest and Google
WordVec model,” International Journal of Geographical Infor-
mation Science,vol.,no.,pp.–,.
[] R. Wang, H. Zhao, B.-L. Lu, M. Utiyama, and E. Sumita, “Bilin-
gual continuous-space language model growing for statistical
machine translation,” IEEE Transactions on Audio, Speech and
Language Processing,vol.,no.,pp.–,.
[] L. Li, G. Liu, and Q. Liu, “Advancing iterative quantization
hashing using isotropic prior,” in Proceedings of the Inter national
Conference on Multimedia Modelling, pp. –, Springer
International Publishing, .