2016 IEEE 32nd International Conference on Data Engineering (ICDE) 2016
DOI: 10.1109/icde.2016.7498229
|View full text |Cite
|
Sign up to set email alerts
|

Crowdsourced POI labelling: Location-aware result inference and Task Assignment

Abstract: Identifying the labels of points of interest (POIs), aka POI labelling, provides significant benefits in location-based services. However, the quality of raw labels manually added by users or generated by artificial algorithms cannot be guaranteed. Such low-quality labels decrease the usability and result in bad user experiences. In this paper, by observing that crowdsourcing is a best-fit for computer-hard tasks, we leverage crowdsourcing to improve the quality of POI labelling. To our best knowledge, this is… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
39
0

Year Published

2018
2018
2019
2019

Publication Types

Select...
4
4

Relationship

0
8

Authors

Journals

citations
Cited by 84 publications
(39 citation statements)
references
References 21 publications
(33 reference statements)
0
39
0
Order By: Relevance
“…Beyond the CF approach, there are various techniques to model annotators' abnormal behaviors in general crowdsourcing [18], [21], [23]- [25], [43], [46], [56]- [59], etc. The basic idea of these work is to characterize user quality using some probabilistic behavior models.…”
Section: Related Workmentioning
confidence: 99%
“…Beyond the CF approach, there are various techniques to model annotators' abnormal behaviors in general crowdsourcing [18], [21], [23]- [25], [43], [46], [56]- [59], etc. The basic idea of these work is to characterize user quality using some probabilistic behavior models.…”
Section: Related Workmentioning
confidence: 99%
“…A recent study distinguishes SC from related fields, including generic crowdsourcing, participatory sensing, volunteered geographic information, and online matching. Research efforts in SC have focused on different aspects, such as task assignment (e.g., [Kazemi and Shahabi 2012;Tong et al 2016;Liu et al 2016b;Hu et al 2016]), task scheduling (e.g., [Deng et al 2016;Li et al 2015;Sales Fonteles et al 2016]), quality control and trust (e.g., [Kazemi et al 2013;Cheng et al 2015]), privacy (e.g., Wang et al 2017]), incentive mechanism (e.g., [Gao et al 2015;Kandappu et al 2016;). The authors in [Kazemi and Shahabi 2012] proposed task assignment problem whose goal is to maximize the number of assigned tasks.…”
Section: Related Workmentioning
confidence: 99%
“…. , bm}, a reliability threshold t Output: An optimal priority queue OP Q 1 Enumerate(1, 0, ∅, B, t); 2 Remove any OP Qi with OP Qi.LCM ≥ OP Qj.LCM and OP Qi.U C ≥ OP Qj.U C for some j; 3 return OP Q; 4 SubFunction:Enumerate(p, q, S, B, t) 5 for k ← p to m do 6 Add b k into S; assigned in this combination, where each atomic task is assigned to six task bins (three 1-cardinality bins, two 2-cardinality bins and one 3-cardinality bins). For example, as shown in the last row in Figure 5, the atomic task a 1 is assigned into the six task bins…”
Section: Constructing the Optimal Priority Queuementioning
confidence: 99%
“…. , S β−1 all ∅; 5 foreach a i ∈ T do 6 Find the lowest j s.t. θ i ≤ 2 j ; 7 Assign a i into S j−α−1 ;…”
Section: Algorithm 5: Opq-extendedmentioning
confidence: 99%
See 1 more Smart Citation