Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Zhenhan Su

dblp:352/7038 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2023
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Databases, data management, data science and information retrieval · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Databases, data mining, and information retrieval
1 paper
Data mining · 67% Machine learning and data management · 33%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Data mining › crowdsourcing
crowdsourced annotation
0.712023
Hierarchical Crowdsourcing for Data Labeling with Heterogeneous Crowd · ICDE 2023
Machine learning and data management
data annotation
0.712023
Hierarchical Crowdsourcing for Data Labeling with Heterogeneous Crowd · ICDE 2023
Data mining › crowdsourcing
label aggregation
0.712023
Hierarchical Crowdsourcing for Data Labeling with Heterogeneous Crowd · ICDE 2023

Methods — techniques the papers use, named apart from their topics

conditional entropy minimization · 0.7approximation algorithm · 0.7
YearPublicationVenuePosition
2023 Hierarchical Crowdsourcing for Data Labeling with Heterogeneous Crowd
abstract
With the rapid and continuous development of data-driven technologies such as supervised learning, high-quality labeled data sets are commonly required by many applications. Due to the easiness of crowdsourcing small tasks with low cost, a straightforward solution for label quality improvement is to collect multiple labels from a crowd, and then aggregate the answers. The aggregation strategies include majority voting and its many variants, EM-based approaches, Graph Neural Nets and so on. However, due to the uncertainty information loss and commonly existing task correlations, the aggregated labels usually contain errors and may damnify the downstream model training.To address the above problem, we propose a hierarchical crowdsourcing framework1for data labeling with noisy answers about correlated data. We make use of the heterogeneity of the labeling crowd and form an initialization-checking-update loop to improve the quality of labeled data. We formalize and successfully solve the core optimization problem, namely, selecting a proper set of checking tasks for each round. We prove that maximizing the expected quality improvement is equivalent to minimizing the conditional entropy of the observations given the crowdsourced answer families for the selected task set, which is NP-hard to solve. Therefore, we design an efficient approximation algorithm and conduct a series of experiments on real data. The experimental results show that the proposed method effectively improves the quality of the labeled data sets as well as the SOTA performance, yet without extra human labor costs.
Wenxi Huang, Zhenhan Su, Junyang Chen 0001, Di Jiang 0004, Lixin Fan, Chen Zhang 0013, Defu Lian, Kaishun Wu
ICDE3