Demo Data from VLDB 2026 / reviewers in the wild / expert
Shaoqing Lin
dblp:410/4895
· DBLP profile ↗
1ranked-venue papers
1as first author
1since 2021 · last 2025
—ORCID · none
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 |
Vision and language · 56% Information extraction and text analysis · 44% |
Topics — the 2 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Natural language and speech › Information extraction and text analysis › discourse analysis › discourse processing
discourse interpretation |
0.9 | 1 | 2025 | DiscoSG: Towards Discourse-Level Text Scene Graph Parsing through Iterative Graph Refinement · EMNLP 2025 |
Computer vision › Vision and language
vision-language model |
0.3 | 1 | 2025 | DiscoSG: Towards Discourse-Level Text Scene Graph Parsing through Iterative Graph Refinement · EMNLP 2025 |
Methods — techniques the papers use, named apart from their topics
iterative graph refinement · 0.9graph editing · 0.9fine-tuning · 0.9
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | DiscoSG: Towards Discourse-Level Text Scene Graph Parsing through Iterative Graph RefinementabstractVision-Language Models (VLMs) generate discourse-level, multi-sentence visual descriptions, challenging text scene graph parsers built for single-sentence caption-to-graph mapping.Current approaches typically merge sentencelevel parsing outputs for discourse input, often missing phenomena like cross-sentence coreference, resulting in fragmented graphs and degraded downstream VLM task performance.We introduce a new task, Discourse-level text Scene Graph parsing (DiscoSG), and release DiscoSG-DS, a dataset of 400 expert-annotated and 8,430 synthesised multi-sentence captiongraph pairs.Each caption averages 9 sentences, and each graph contains at least 3× more triples than those in existing datasets.Fine-tuning GPT-4o on DiscoSG-DS yields over 40% higher SPICE metric than the best sentence-merging baseline.However, its high inference cost and licensing restrict opensource use.Smaller fine-tuned open-source models (e.g., Flan-T5) perform well on simpler graphs yet degrade on denser, more complex graphs.To bridge this gap, we introduce DiscoSG-Refiner, a lightweight open-source parser that drafts a seed graph and iteratively refines it with a novel learned graph-editing model, achieving 30% higher SPICE than the baseline while delivering 86× faster inference than GPT-4o.It generalises from simple to dense graphs, thereby consistently improving downstream VLM tasks, including discourselevel caption evaluation and hallucination detection, outperforming alternative open-source parsers. Shaoqing Lin, Chong Teng, Fei Li 0021, Donghong Ji, Lizhen Qu, Zhuang Li 0001 |
EMNLP | 1 |