Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Mingda Li 0002

dblp:32/10146-2 · DBLP profile ↗
← Back
9ranked-venue papers
4as first author
9since 2021 · last 2026
0000-0002-7240-2063ORCID · conflict

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 6 · 4 first-author · 6 since 2021Applied, interdisciplinary, general and emerging computing · 3 · 3 since 2021Databases, data management, data science and information retrieval · 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
Language models and text generation · 87% Multi-agent systems · 13%
Databases, data mining, and information retrieval
1 paper
Knowledge graphs · 100%

Topics — the 5 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Natural language and speech › Language models and text generation › retrieval-augmented generation
knowledge graph retrieval-augmented generation
1.012026
Towards Open-World Retrieval-Augmented Generation on Knowledge Graph: A Multi-Agent Collaboration Framework · WWW 2026
Natural language and speech › Language models and text generation
retrieval-augmented generation
1.012026
Towards Open-World Retrieval-Augmented Generation on Knowledge Graph: A Multi-Agent Collaboration Framework · WWW 2026
Knowledge graphs
knowledge graph reasoning
1.012026
Towards Open-World Retrieval-Augmented Generation on Knowledge Graph: A Multi-Agent Collaboration Framework · WWW 2026
Knowledge graphs › knowledge graph reasoning
multi-hop reasoning
1.012026
Towards Open-World Retrieval-Augmented Generation on Knowledge Graph: A Multi-Agent Collaboration Framework · WWW 2026
Knowledge, reasoning and agents › Multi-agent systems
multi-agent collaboration
0.312026
Towards Open-World Retrieval-Augmented Generation on Knowledge Graph: A Multi-Agent Collaboration Framework · WWW 2026

Methods — techniques the papers use, named apart from their topics

retrieval-augmented generation · 2.0large language model · 2.0
YearPublicationVenuePosition
2026 Towards Open-World Retrieval-Augmented Generation on Knowledge Graph: A Multi-Agent Collaboration Framework
abstract
Large Language Models (LLMs) have demonstrated strong capabilities in web search and reasoning. However, their dependence on static training corpora makes them prone to factual errors and knowledge gaps. Retrieval-Augmented Generation (RAG) addresses this limitation by incorporating external knowledge sources, especially structured Knowledge Graphs (KGs), which provide explicit semantics and efficient retrieval. Existing KG-based RAG approaches, however, generally assume that anchor entities are accessible to initiate graph traversal, which limits their robustness in open-world settings where accurate linking between the user query and the KG entity is unreliable. To overcome this limitation, we propose AnchorRAG, a novel multi-agent collaboration framework for open-world RAG without the predefined anchor entities. Specifically, a predictor agent dynamically identifies candidate anchor entities by aligning user query terms with KG nodes and initializes independent retriever agents to conduct parallel multi-hop explorations from each candidate. Then a supervisor agent formulates the iterative retrieval strategy for these retriever agents and synthesizes the resulting knowledge paths to generate the final answer. This multi-agent collaboration framework improves retrieval robustness and mitigates the impact of ambiguous or erroneous anchors. Extensive experiments on four public benchmarks demonstrate that AnchorRAG significantly outperforms existing baselines and establishes new state-of-the-art results on the real-world reasoning tasks.
Jiasheng Xu, Mingda Li 0002, Yongqiang Tang, Wensheng Zhang 0002
WWW2
2026 Maximizing mutual information across knowledge graphs for robust entity alignment
Ao Gao, Mingda Li 0002, Zhengya Sun
Expert Syst. Appl.2
2026 Auto-weighted graph structure learning of multi-dimensional biomarkers for indirect estimation of pediatric reference intervals
Jianguo Zheng, Yongqiang Tang, Yaguang Peng, Rui Chen 0032, Mingda Li 0002, Ruohua Yan, Wensheng Zhang 0002, XiaoXia Peng
Expert Syst. Appl.6
2026 Beyond alignment: Discovering cross-graph triples for knowledge graph integration
Mingda Li 0002, Ao Gao, Yongqiang Tang, Yuanpeng Deng, Wensheng Zhang 0002
Knowl. Based Syst.1
2025 Contrastive Learning With Transformer to Predict the Chronicity of Children With Immune Thrombocytopenia
abstract
Immune thrombocytopenia (ITP) is a typically self-limiting and immune-mediated bleeding disorder in children. Approximately 20% of children with ITP experience chronicity, leading to reduced quality of life and increased treatment burden. The accurate prediction of chronicity would enable clinicians to make personalized treatment plans at an early stage. However, due to the self-limiting nature of ITP and the scarcity of available children patients, the data presents two prominent issues: small data and imbalanced class, which are unfavorable for effectively training a deep learning model. To handle these issues concurrently, we proposed a novel method that integrates contrastive learning with the Transformer. First, we adopt the FT-Transformer as our backbone, which allows our model to flexibly process heterogeneous tabular data. Second, we amplify and balance the original data via random masking and oversampling, respectively. Lastly, we build contrastive pairs according to the latent representations generated by the FT-Transformer encoder, such that the amplified and oversampled synthetic data can be utilized thoroughly. The experimental results on real-world ITP children data show that our proposal outperforms the state-of-the-art methods, and demonstrate the significant advantages of dealing with insufficient and imbalanced problems.
Yuntian Wang, Yongqiang Tang, Jingyao Ma, Zhenping Chen, Chang Cui, Mingda Li 0002, Runhui Wu, Wensheng Zhang 0002
IEEE J. Biomed. Health Informatics6
2023 Leveraging semantic property for temporal knowledge graph completion
Mingda Li 0002, Zhengya Sun, Wensheng Zhang 0002
Appl. Intell.1
2022 SLAN: Similarity-aware aggregation network for embedding out-of-knowledge-graph entities
Mingda Li 0002, Zhengya Sun, Wensheng Zhang 0002
Neurocomputing1
2022 Multi-level semantic fusion network for Chinese medical named entity recognition
Jintong Shi, Mengxuan Sun, Zhengya Sun, Mingda Li 0002, Wensheng Zhang 0002
J. Biomed. Informatics4
2021 Enhancing knowledge graph embedding with relational constraints
Mingda Li 0002, Zhengya Sun, Siheng Zhang, Wensheng Zhang 0002
Neurocomputing1