Graph Mining Meets Crowdsourcing: Extracting Experts for Answer Aggregation
원문 초록
Aggregating responses from crowd workers is a fundamental task in the process of crowdsourcing. In cases where a few experts are overwhelmed by a large number of non-experts, most answer aggregation algorithms such as the majority voting fail to identify the correct answers. Therefore, it is crucial to extract reliable experts from the crowd workers. In this study, we introduce the notion of "expert core", which is a set of workers that is very unlikely to contain a non-expert. We design a graph-mining-based efficient algorithm that exactly computes the expert core. To answer the aggregation task, we propose two types of algorithms. The first one incorporates the expert core into existing answer aggregation algorithms such as the majority voting, whereas the second one utilizes information provided by the expert core extraction algorithm pertaining to the reliability of workers. We then give a theoretical justification for the first type of algorithm. Computational experiments using synthetic and real-world datasets demonstrate that our proposed answer aggregation algorithms outperform state-of-the-art algorithms.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Efficient Parallel Genetic Algorithm for Perturbed Substructure Optimization in Complex Network
Correlation-Aware Graph Convolutional Networks for Multi-Label Node Classification
Higher-Order GNNs Meet Efficiency: Sparse Sobolev Graph Neural Networks
Accurate and Fast Estimation of Temporal Motifs using Path Sampling
Refining Wikidata Taxonomy using Large Language Models
A Versatile Framework for Attributed Network Clustering via K-Nearest Neighbor Augmentation
토론
이 논문과 연결된 포럼 글이 아직 없습니다.