VLDB 2026 Research / reviewers in the wild / expert
Yingyao Liu
dblp:300/5650
· DBLP profile ↗
1ranked-venue papers
0as first author
1since 2021 · last 2021
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 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
1 paper |
Information extraction and text analysis · 77% Graph learning · 23% |
Topics — the 1 heaviest of 2, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Natural language and speech › Information extraction and text analysis › text classification
weakly supervised text classification |
0.5 | 1 | 2021 | Weakly-supervised Text Classification Based on Keyword Graph · EMNLP (1) 2021 |
Methods — techniques the papers use, named apart from their topics
self-supervised pretraining · 0.5pseudo-labeling · 0.5graph neural network · 0.5
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2021 | Weakly-supervised Text Classification Based on Keyword GraphabstractWeakly-supervised text classification has received much attention in recent years for it can alleviate the heavy burden of annotating massive data.Among them, keyword-driven methods are the mainstream where user-provided keywords are exploited to generate pseudolabels for unlabeled texts.However, existing methods treat keywords independently, thus ignore the correlation among them, which should be useful if properly exploited.In this paper, we propose a novel framework called ClassKG to explore keyword-keyword correlation on keyword graph by GNN.Our framework is an iterative process.In each iteration, we first construct a keyword graph, so the task of assigning pseudo labels is transformed to annotating keyword subgraphs.To improve the annotation quality, we introduce a self-supervised task to pretrain a subgraph annotator, and then finetune it.With the pseudo labels generated by the subgraph annotator, we then train a text classifier to classify the unlabeled texts.Finally, we re-extract keywords from the classified texts.Extensive experiments on both long-text and short-text datasets show that our method substantially outperforms the existing ones. Lu Zhang 0060, Jiandong Ding, Yi Xu 0003, Yingyao Liu, Shuigeng Zhou |
EMNLP (1) | 4 |