Demo Data from EDBT 2026 / reviewers in the wild / expert
Zhenbang You
dblp:305/0335
· DBLP profile ↗
3ranked-venue papers
0as first author
3since 2021 · last 2024
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 2 · 2 since 2021Databases, 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.
| Artificial intelligence
3 papers |
Graph learning · 63% Trustworthy machine learning · 21% Efficient and distributed learning · 17% | |
| Databases, data mining, and information retrieval
1 paper |
Data mining · 100% |
Topics — the 8 heaviest of 8, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Graph learning
graph neural network |
1.3 | 2 | 2024 | NC-ALG: Graph-Based Active Learning Under Noisy Crowd · ICDE 2024 RIM: Reliable Influence-based Active Learning on Graphs · NeurIPS 2021 |
Machine learning › Graph learning › efficient graph learning › data-efficient graph learning
active learning on graphs |
1.1 | 2 | 2022 | Information Gain Propagation: a New Way to Graph Active Learning with Soft Labels · ICLR 2022 RIM: Reliable Influence-based Active Learning on Graphs · NeurIPS 2021 |
Machine learning › Efficient and distributed learning
active learning |
0.8 | 1 | 2024 | NC-ALG: Graph-Based Active Learning Under Noisy Crowd · ICDE 2024 |
Machine learning › Trustworthy machine learning › robustness
learning with noisy labels |
0.8 | 1 | 2024 | NC-ALG: Graph-Based Active Learning Under Noisy Crowd · ICDE 2024 |
Machine learning › Graph learning
influence maximization |
0.5 | 1 | 2021 | RIM: Reliable Influence-based Active Learning on Graphs · NeurIPS 2021 |
Data mining
crowdsourcing |
0.2 | 1 | 2024 | NC-ALG: Graph-Based Active Learning Under Noisy Crowd · ICDE 2024 |
Data mining › crowdsourcing
label aggregation |
0.2 | 1 | 2024 | NC-ALG: Graph-Based Active Learning Under Noisy Crowd · ICDE 2024 |
Machine learning › Trustworthy machine learning › robustness › learning with noisy labels
soft labels |
0.2 | 1 | 2022 | Information Gain Propagation: a New Way to Graph Active Learning with Soft Labels · ICLR 2022 |
Methods — techniques the papers use, named apart from their topics
influence maximization · 2.0reliability modeling · 1.5information gain propagation · 0.6message passing · 0.5
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2024 | NC-ALG: Graph-Based Active Learning Under Noisy CrowdabstractGraph Neural Networks (GNNs) have achieved great success in various data mining tasks but they heavily rely on a large number of annotated nodes, requiring considerable human efforts. Despite the effectiveness of existing GNN-based Active Learning (AL) methods, they assume that the annotated labels are always correct, which is contradictory to the error-prone labeling process in a practical crowdsourcing environment. Besides, due to this impractical assumption, existing works only focus on optimizing the node selection in AL but neglect optimizing the labeling process. Therefore, we present NC-ALG, the first GNN-based AL framework that optimizes both the node selection and node labeling process under a noisy crowd. For node selection, NC-ALG introduces a new measurement to model influence reliability and an effective influence maximization objective to select nodes. For node labeling, NC-ALG significantly reduces the labeling cost by considering the model-predicted labels and the labels of mirror nodes. To the best of our knowledge, this is the first attempt to consider GNN-based AL under the practical noisy crowd. Empirical studies on public datasets demonstrate that NC-ALG significantly outperforms existing methods in terms labeling efficiency. Notably, it only takes NC-ALG one-third of the labeling budget that the competitive baseline GRAIN needs to achieve an accuracy of 70.7 % on PubMed. Wentao Zhang 0001, Yexin Wang, Zhenbang You, Yang Li 0106, Gang Cao 0003, Zhi Yang 0001, Bin Cui 0001 |
ICDE | 3 |
| 2022 | Information Gain Propagation: a New Way to Graph Active Learning with Soft Labels
Wentao Zhang 0001, Yexin Wang, Zhenbang You, Jiulong Shan, Zhi Yang 0001, Bin Cui 0001 |
ICLR | 3 |
| 2021 | RIM: Reliable Influence-based Active Learning on GraphsabstractMessage passing is the core of most graph models such as Graph Convolutional Network (GCN) and Label Propagation (LP), which usually require a large number of clean labeled data to smooth out the neighborhood over the graph. However, the labeling process can be tedious, costly, and error-prone in practice. In this paper, we propose to unify active learning (AL) and message passing towards minimizing labeling costs, e.g., making use of few and unreliable labels that can be obtained cheaply. We make two contributions towards that end. First, we open up a perspective by drawing a connection between AL enforcing message passing and social influence maximization, ensuring that the selected samples effectively improve the model performance. Second, we propose an extension to the influence model that incorporates an explicit quality factor to model label noise. In this way, we derive a fundamentally new AL selection criterion for GCN and LP--reliable influence maximization (RIM)--by considering quantity and quality of influence simultaneously. Empirical studies on public datasets show that RIM significantly outperforms current AL methods in terms of accuracy and efficiency. Wentao Zhang 0001, Yexin Wang, Zhenbang You, Jiulong Shan, Zhi Yang 0001, Bin Cui 0001 |
NeurIPS | 3 |