Demo Data from EDBT 2026 / reviewers in the wild / expert
Miao Su
dblp:304/8354
· DBLP profile ↗
4ranked-venue papers
1as first author
4since 2021 · last 2025
—ORCID · conflict
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 4 · 1 first-author · 4 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 |
Knowledge graphs · 100% | |
| Artificial intelligence
1 paper |
Knowledge representation and reasoning · 77% Language models and text generation · 23% |
Topics — the 4 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Knowledge graphs
link prediction |
0.9 | 1 | 2025 | A Survey of Link Prediction in N-ary Knowledge Graphs · EMNLP 2025 |
Knowledge graphs › link prediction
n-ary relational link prediction |
0.9 | 1 | 2025 | A Survey of Link Prediction in N-ary Knowledge Graphs · EMNLP 2025 |
Knowledge, reasoning and agents › Knowledge representation and reasoning › knowledge acquisition › knowledge extraction
universal information extraction |
0.8 | 1 | 2024 | KnowCoder: Coding Structured Knowledge into LLMs for Universal Information Extraction · ACL (1) 2024 |
Natural language and speech › Language models and text generation › knowledge editing
knowledge injection into language models |
0.2 | 1 | 2024 | KnowCoder: Coding Structured Knowledge into LLMs for Universal Information Extraction · ACL (1) 2024 |
Methods — techniques the papers use, named apart from their topics
survey · 0.9instruction tuning · 0.8code-based knowledge representation · 0.8
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | A Survey of Link Prediction in N-ary Knowledge GraphsabstractN-ary Knowledge Graphs (NKGs) are a specialized type of knowledge graph designed to efficiently represent complex real-world facts.Unlike traditional knowledge graphs, where a fact typically involves two entities, NKGs can capture n-ary facts containing more than two entities.Link prediction in NKGs aims to predict missing elements within these n-ary facts, which is essential for completing NKGs and improving the performance of downstream applications.This task has recently gained significant attention.In this paper, we present the first comprehensive survey of link prediction in NKGs, providing an overview of the field, systematically categorizing existing methods, and analyzing their performance and application scenarios.We also outline promising directions for future research. Jiyao Wei, Saiping Guan, Da Li 0003, Zhongni Hou, Miao Su, Yucan Guo, Xiaolong Jin 0001, Jiafeng Guo, Xueqi Cheng 0001 |
EMNLP | 5 |
| 2024 | KnowCoder: Coding Structured Knowledge into LLMs for Universal Information ExtractionabstractZixuan Li, Yutao Zeng, Yuxin Zuo, Weicheng Ren, Wenxuan Liu, Miao Su, Yucan Guo, Yantao Liu, Xiang Li, Zhilei Hu, Long Bai, Wei Li, Yidan Liu, Pan Yang, Xiaolong Jin, Jiafeng Guo, Xueqi Cheng. Proceedings of the 62nd Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers). 2024. Zixuan Li 0001, Yutao Zeng, Yuxin Zuo, Weicheng Ren, Wenxuan Liu 0003, Miao Su, Yucan Guo, Yantao Liu, Xiang Li 0001, Zhilei Hu, Long Bai 0002, Wei Li 0176, Yidan Liu, Xiaolong Jin 0001, Jiafeng Guo, Xueqi Cheng 0001 |
ACL (1) | 6 |
| 2024 | Nested Event Extraction upon Pivot Element RecognitionabstractNested Event Extraction (NEE) aims to extract complex event structures where an event contains other events as its arguments recursively. Nested events involve a kind of Pivot Elements (PEs) that simultaneously act as arguments of outer-nest events and as triggers of inner-nest events, and thus connect them into nested structures. This special characteristic of PEs brings challenges to existing NEE methods, as they cannot well cope with the dual identities of PEs. Therefore, this paper proposes a new model, called PerNee, which extracts nested events mainly based on recognizing PEs. Specifically, PerNee first recognizes the triggers of both inner-nest and outer-nest events and further recognizes the PEs via classifying the relation type between trigger pairs. The model uses prompt learning to incorporate information from both event types and argument roles for better trigger and argument representations to improve NEE performance. Since existing NEE datasets (e.g., Genia11) are limited to specific domains and contain a narrow range of event types with nested structures, we systematically categorize nested events in the generic domain and construct a new NEE dataset, called ACE2005-Nest. Experimental results demonstrate that PerNee consistently achieves state-of-the-art performance on ACE2005-Nest, Genia11, and Genia13. The ACE2005-Nest dataset and the code of the PerNee model are available at https://github.com/waysonren/PerNee. Weicheng Ren, Zixuan Li 0001, Xiaolong Jin 0001, Long Bai 0002, Miao Su, Yantao Liu, Saiping Guan, Jiafeng Guo, Xueqi Cheng 0001 |
LREC/COLING | 5 |
| 2021 | A visualized bibliometric analysis of mapping research trends of machine learning in engineering (MLE)
Miao Su, Shaofan Li |
Expert Syst. Appl. | 1 |