Demo Data from VLDB 2026 / reviewers in the wild / expert
Kaixin Zheng
dblp:339/3474
· DBLP profile ↗
1ranked-venue papers
1as first author
1since 2021 · last 2022
—ORCID · unresolved
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 1 · 1 first-author · 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 · 61% Graph learning · 39% |
Topics — the 4 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Graph learning › graph representation learning › inductive representation learning
inductive graph learning |
0.6 | 1 | 2022 | Simplified Graph Learning for Inductive Short Text Classification · EMNLP 2022 |
Natural language and speech › Information extraction and text analysis › text classification
short text classification |
0.6 | 1 | 2022 | Simplified Graph Learning for Inductive Short Text Classification · EMNLP 2022 |
Natural language and speech › Information extraction and text analysis
text classification |
0.6 | 1 | 2022 | Simplified Graph Learning for Inductive Short Text Classification · EMNLP 2022 |
Machine learning › Graph learning › graph representation learning
text graph learning |
0.2 | 1 | 2022 | Simplified Graph Learning for Inductive Short Text Classification · EMNLP 2022 |
Methods — techniques the papers use, named apart from their topics
message passing · 0.6graph neural network · 0.6
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2022 | Simplified Graph Learning for Inductive Short Text ClassificationabstractShort text classification (STC) is hard as short texts lack context information and labeled data is not enough.Graph neural networks obtain the state-of-the-art on STC since they can merge various auxiliary information via the message passing framework.However, existing works conduct transductive learning, which requires retraining to accommodate new samples and takes large memory.In this paper, we present SimpleSTC which handles inductive STC problem but only leverages words.We construct word graph from an external large corpus to compensate for the lack of semantic information, and learn text graph to handle the lack of labeled data.Results show that Sim-pleSTC obtains state-of-the-art performance with lower memory consumption and faster inference speed. 1 Kaixin Zheng, Yaqing Wang 0002, Quanming Yao, Dejing Dou |
EMNLP | 1 |