2018
DOI: 10.1007/978-3-030-03493-1_81
|View full text |Cite
|
Sign up to set email alerts
|

CGLAD: Using GLAD in Crowdsourced Large Datasets

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2018
2018
2019
2019

Publication Types

Select...
2

Relationship

1
1

Authors

Journals

citations
Cited by 2 publications
(1 citation statement)
references
References 7 publications
0
1
0
Order By: Relevance
“…Other authors highlight that estimating the difficulty of annotators could improve the reliability of the annotator performance estimation, which could lead to more powerful models (Aung & Whitehill, ; Cao et al, ; Duan et al, ; Nguyen‐Dinh et al, ; Ni et al, ; Wan & Aggarwal, ). There are some classic crowdsourcing algorithms that take into account instance difficulty, such as (Donmez, Carbonell, & Schneider, ; Welinder, Branson, Perona, & Belongie, ; Whitehill, fan Wu, Bergsma, Movellan, & Ruvolo, ), which could be used directly or as a basis for the development of new algorithms that consider the restrictions of the problem at hand, such as the scalability to a large number of examples or the time complexity of the algorithm (Rodrigo, Aledo, & Gámez, ).…”
Section: Future Research In the Fieldmentioning
confidence: 99%
“…Other authors highlight that estimating the difficulty of annotators could improve the reliability of the annotator performance estimation, which could lead to more powerful models (Aung & Whitehill, ; Cao et al, ; Duan et al, ; Nguyen‐Dinh et al, ; Ni et al, ; Wan & Aggarwal, ). There are some classic crowdsourcing algorithms that take into account instance difficulty, such as (Donmez, Carbonell, & Schneider, ; Welinder, Branson, Perona, & Belongie, ; Whitehill, fan Wu, Bergsma, Movellan, & Ruvolo, ), which could be used directly or as a basis for the development of new algorithms that consider the restrictions of the problem at hand, such as the scalability to a large number of examples or the time complexity of the algorithm (Rodrigo, Aledo, & Gámez, ).…”
Section: Future Research In the Fieldmentioning
confidence: 99%