Demo Data from EDBT 2026 / reviewers in the wild / expert
Duokang Wang
dblp:359/0422
· DBLP profile ↗
3ranked-venue papers
1as first author
3since 2021 · last 2024
0009-0006-3290-7303ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Graphics, computer vision, multimedia, augmented reality and games · 2 · 2 since 2021Artificial intelligence and machine learning · 1 · 1 since 2021Databases, data management, data science and information retrieval · 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
3 papers |
Vision and language · 48% Language models and text generation · 19% Information extraction and text analysis · 10% |
Topics — the 11 heaviest of 11, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Natural language and speech › Language models and text generation
chart generation |
0.8 | 1 | 2024 | NovaChart: A Large-scale Dataset towards Chart Understanding and Generation of Multimodal Large Language Models · ACM Multimedia 2024 |
Computer vision › Vision and language › vision-language model › multimodal large language model
chart understanding |
0.8 | 1 | 2024 | NovaChart: A Large-scale Dataset towards Chart Understanding and Generation of Multimodal Large Language Models · ACM Multimedia 2024 |
Computer vision › Vision and language › visual question answering
knowledge-based visual question answering |
0.8 | 1 | 2024 | Let Me Show You Step by Step: An Interpretable Graph Routing Network for Knowledge-based Visual Question Answering · SIGIR 2024 |
Knowledge, reasoning and agents › Knowledge representation and reasoning
knowledge graph reasoning |
0.8 | 1 | 2024 | Let Me Show You Step by Step: An Interpretable Graph Routing Network for Knowledge-based Visual Question Answering · SIGIR 2024 |
Natural language and speech › Language models and text generation
large language model |
0.8 | 1 | 2024 | LLM vs Small Model? Large Language Model Based Text Augmentation Enhanced Personality Detection Model · AAAI 2024 |
Machine learning › Generative modeling › synthetic data generation › text data augmentation
LLM-based text augmentation |
0.8 | 1 | 2024 | LLM vs Small Model? Large Language Model Based Text Augmentation Enhanced Personality Detection Model · AAAI 2024 |
Computer vision › Vision and language › vision-language model
multimodal large language model |
0.8 | 1 | 2024 | NovaChart: A Large-scale Dataset towards Chart Understanding and Generation of Multimodal Large Language Models · ACM Multimedia 2024 |
Natural language and speech › Information extraction and text analysis › user profiling
personality recognition |
0.8 | 1 | 2024 | LLM vs Small Model? Large Language Model Based Text Augmentation Enhanced Personality Detection Model · AAAI 2024 |
Computer vision › Vision and language › vision-language dataset
vision-language dataset construction |
0.8 | 1 | 2024 | NovaChart: A Large-scale Dataset towards Chart Understanding and Generation of Multimodal Large Language Models · ACM Multimedia 2024 |
Computer vision › Vision and language
visual question answering |
0.8 | 1 | 2024 | Let Me Show You Step by Step: An Interpretable Graph Routing Network for Knowledge-based Visual Question Answering · SIGIR 2024 |
Machine learning › Representation and self-supervised learning
contrastive learning |
0.2 | 1 | 2024 | LLM vs Small Model? Large Language Model Based Text Augmentation Enhanced Personality Detection Model · AAAI 2024 |
Methods — techniques the papers use, named apart from their topics
multimodal large language model · 1.5large language model · 0.8knowledge distillation · 0.8instruction tuning · 0.8graph neural network · 0.8data generation engine · 0.8contrastive learning · 0.8
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2024 | LLM vs Small Model? Large Language Model Based Text Augmentation Enhanced Personality Detection ModelabstractPersonality detection aims to detect one's personality traits underlying in social media posts. One challenge of this task is the scarcity of ground-truth personality traits which are collected from self-report questionnaires. Most existing methods learn post features directly by fine-tuning the pre-trained language models under the supervision of limited personality labels. This leads to inferior quality of post features and consequently affects the performance. In addition, they treat personality traits as one-hot classification labels, overlooking the semantic information within them. In this paper, we propose a large language model (LLM) based text augmentation enhanced personality detection model, which distills the LLM's knowledge to enhance the small model for personality detection, even when the LLM fails in this task. Specifically, we enable LLM to generate post analyses (augmentations) from the aspects of semantic, sentiment, and linguistic, which are critical for personality detection. By using contrastive learning to pull them together in the embedding space, the post encoder can better capture the psycho-linguistic information within the post representations, thus improving personality detection. Furthermore, we utilize the LLM to enrich the information of personality labels for enhancing the detection performance. Experimental results on the benchmark datasets demonstrate that our model outperforms the state-of-the-art methods on personality detection. Linmei Hu, Duokang Wang, Ziwang Zhao, Yingxia Shao, Liqiang Nie |
AAAI | 3 |
| 2024 | NovaChart: A Large-scale Dataset towards Chart Understanding and Generation of Multimodal Large Language ModelsabstractMultimodal Large Language Models (MLLMs) have shown significant potential for chart understanding and generation. However, they are still far from achieving the desired effectiveness in practical applications. This could be due to the limitations of the used training chart data. Existing chart datasets suffer from scarcity of chart types, limited coverage of tasks, and insufficient scalability, making them incapable of effectively enhancing the chart-related capabilities of MLLMs. To tackle these obstacles, we construct NovaChart, a large-scale dataset for chart understanding and generation of MLLMs. NovaChart contains 47K high-resolution chart images and 856K chart-related instructions, covering 18 different chart types and 15 unique tasks of chart understanding and generation. To build NovaChart, we propose a data generation engine for metadata curation, chart visualization and instruction formulation. Chart metadata in NovaChart contains detailed annotations, i.e., data points, visual elements, source data and the visualization code of every chart. This additional information endows NovaChart with considerable scalability, as it can facilitate the extension of chart instruction data to a larger scale and greater diversity. We utilize NovaChart to train several open-source MLLMs. Experimental results demonstrate NovaChart empowers MLLMs with stronger capabilities in 15 chart understanding and generation tasks by a large-margin (35.47%-619.47%), bringing them a step closer to smart chart assistants. Our dataset is now available at https://github.com/Elucidator-V/NovaChart. Linmei Hu, Duokang Wang, Yiming Pan 0003, Jifan Yu, Yingxia Shao, Chong Feng 0001, Liqiang Nie |
ACM Multimedia | 2 |
| 2024 | Let Me Show You Step by Step: An Interpretable Graph Routing Network for Knowledge-based Visual Question AnsweringabstractVisual Question Answering based on external Knowledge Bases (KB-VQA) requires a model to incorporate knowledge beyond the content of given image and question for answer prediction. Most existing works made efforts on using graph neural networks or Multi-modal Large Language Models to incorporate external knowledge for answer generation. Despite the promising results, they have limited interpretability and exhibit a deficiency in handling questions with unseen answers. In this paper, we propose a novel interpretable graph routing network (GRN) which explicitly conducts entity routing over a constructed scene knowledge graph step by step for KB-VQA. At each step, GRN keeps an entity score vector representing how likely of each entity to be activated as the answer, and a transition matrix representing the transition probability from one entity to another. To answer the given question, GRN will focus on certain keywords of the question at each step and correspondingly conduct entity routing by transiting the entity scores according to the transition matrix computed referring to the focused question keywords. In this way, it clearly provides the reasoning process of KB-VQA and can handle the questions with unseen answers without distinction. Experiments on the benchmark dataset KRVQA have demonstrated that GRN improves the performance of KB-VQA by a large margin, surpassing existing state-of-the art KB-VQA methods and Multi-modal Large Language Models, as well as shows competent capability in handling unseen answers and good interpretability in KB-VQA. Duokang Wang, Linmei Hu, Yingxia Shao, Liqiang Nie, Juan-Zi Li |
SIGIR | 1 |