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

Qiubai Zhu

dblp:406/9043 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2025
0009-0004-2587-5310ORCID · reported

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

Graphics, computer vision, multimedia, augmented reality and games · 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.

Databases, data mining, and information retrieval
1 paper
Knowledge graphs · 100%
Artificial intelligence
1 paper
Information extraction and text analysis · 100%

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

TopicWeightPapersLastEvidence papers
Knowledge graphs
knowledge graph construction
0.912025
An Adaptive Framework Embedded With LLM for Knowledge Graph Construction · IEEE Trans. Multim. 2025
Knowledge graphs › knowledge graph construction
triple extraction
0.912025
An Adaptive Framework Embedded With LLM for Knowledge Graph Construction · IEEE Trans. Multim. 2025
Natural language and speech › Information extraction and text analysis
relation extraction
0.312025
An Adaptive Framework Embedded With LLM for Knowledge Graph Construction · IEEE Trans. Multim. 2025

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

schema embedding · 1.7large language model · 1.7
YearPublicationVenuePosition
2025 An Adaptive Framework Embedded With LLM for Knowledge Graph Construction
abstract
Knowledge graph construction is aimed at storing and representing the knowledge of the objective world in a structured form. Existing methods for automatic construction of knowledge graphs have problems such as difficulty in understanding potential semantics and low precision. The emergence of Large Language Models (LLMs) provides an effective way for automatic knowledge graph construction. However, using LLMs as automatic knowledge graph construction engines relies on the embedding of schema layers, which brings challenges to the input length of LLMs. In this paper, we present a framework for Adaptive Construction of Knowledge Graph by leveraging the exceptional generation capabilities of LLMs and the latent relational semantic information of triples, named ACKG-LLM. Our proposed framework divides the knowledge graph construction task into three subtasks within a unified pipeline: triple extraction of open information, additional relational semantic information embedding and knowledge graph normalization based on schema-level embedding. The framework can construct knowledge graphs in different domains, making up for the defects of existing frameworks that need to retrain and fine-tune the internal model. Extensive experiments demonstrate that our proposed ACKG-LLM performs favorably against representative methods on the REBEL and WiKi-NRE datasets. The code is available athttps://github.com/KustTeamWQW/ACKG-LLM
Qingwang Wang, Chaohui Li, Qiubai Zhu, Jian Song 0011, Tao Shen 0004
IEEE Trans. Multim.4