MétaCan
Menu
Back to cohort
Record W2899134503 · doi:10.1145/3274423

Resolvable vs. Irresolvable Disagreement

2018· article· en· W2899134503 on OpenAlexafffund
Mike Schaekermann, Joslin Goh, Kate Larson, Edith Law

Bibliographic record

VenueProceedings of the ACM on Human-Computer Interaction · 2018
Typearticle
Languageen
FieldComputer Science
TopicMobile Crowdsensing and Crowdsourcing
Canadian institutionsUniversity of Waterloo
FundersNatural Sciences and Engineering Research Council of CanadaCanadian Institutes of Health ResearchCalifornia HIV/AIDS Research Program
KeywordsDeliberationTask (project management)Set (abstract data type)Process (computing)Quality (philosophy)Computer scienceWorkflowWork (physics)PsychologyCognitive psychologyArtificial intelligenceSocial psychologyEpistemologyPolitical scienceEngineering

Abstract

fetched live from OpenAlex

Crowdsourced classification of data typically assumes that objects can be unambiguously classified into categories. In practice, many classification tasks are ambiguous due to various forms of disagreement. Prior work shows that exchanging verbal justifications can significantly improve answer accuracy over aggregation techniques. In this work, we study how worker deliberation affects resolvability and accuracy using case studies with both an objective and a subjective task. Results show that case resolvability depends on various factors, including the level and reasons for the initial disagreement, as well as the amount and quality of deliberation activities. Our work reinforces the finding that deliberation can increase answer accuracy and the importance of verbal discussion in this process. We contribute a new public data set on worker deliberation for text classification tasks, and discuss considerations for the design of deliberation workflows for classification.

Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.

How this classification was reachedexpand

Full frame machine prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.

metaresearch head score (Codex)0.091
metaresearch head score (Gemma)0.457
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Qualitative · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: Empirical
Teacher disagreement score0.091
Threshold uncertainty score0.482

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0910.457
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0010.002
Bibliometrics0.0030.002
Science and technology studies0.0050.008
Scholarly communication0.0080.010
Open science0.0030.010
Research integrity0.0050.006
Insufficient payload (model declined to judge)0.0060.002

Machine scores (provisional)

The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.

Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.

Opus teacher head0.041
GPT teacher head0.302
Teacher spread0.261 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Classification

machine, unvalidated

Machine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designQualitative
Domainnot available
GenreEmpirical

How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".

Quick stats

Citations55
Published2018
Admission routes2
Has abstractyes

Explore more

Same venueProceedings of the ACM on Human-Computer InteractionSame topicMobile Crowdsensing and CrowdsourcingFrench-language works237,207