Qian Li

Dr. Qian Li


Research Focus & Metrics

Academic Career Length

6Years (2021-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
11 June 2021 in IEEE Transactions on Neural Networks and Learning Systems
Verified
Journal Article
Closed access
QLQian Li
Qian Li
DWDaling Wang
Daling Wang
SFShi Feng
Shi Feng
CNCheng Niu
Cheng Niu
YZYifei Zhang
Yifei Zhang
The incompleteness of knowledge graphs triggers considerable research interest in relation prediction. As the key to predicting relations among entities, many efforts have been devoted to learning the embeddings of entities and relations by incorporating a variety of neighbors' information which includes not only the information from direct outgoing and incoming neighbors but also the ones from the indirect neighbors on the multihop paths. However, previous models usually consider entity paths of limited length or ignore sequential information of the paths. Either simplification will make the model lack a global understanding of knowledge graphs and may result in the loss of important and indispensable information. In this article, we propose a novel global graph attention embedding network (GGAE) for relation prediction by combining global information from both direct neighbors and multihop neighbors. Concretely, given a knowledge graph, we first introduce the path construction algorithms to obtain meaningful paths, then design path modeling methods to capture the potential long-distance sequential information in the multihop paths, final propose an entity graph attention and a relation graph attention mechanisms to obtain entity embeddings and relation embeddings. Moreover, an entity graph attention mechanism is proposed to calculate the entity embeddings by aggregating direct incoming and outgoing neighbors from: 1) an original knowledge graph with the original entity and relation embeddings and 2) a new knowledge graph constructed by the paths whose embeddings are updated by path modeling methods. for each relation, we construct a new graph with related entities and present a relation graph attention to learn the features. Therefore, our model can encapsulate the information from different distance neighbors, and enable the embeddings of entities and relations to better capture all-sided semantic information. The experimental results on benchmark datasets verify the superiority of our model over the state-of-the-art ones.

10 July 2025 in Mathematics
Verified
Journal Article
Open access
PDF file
BLBingchen Liu
Bingchen Liu
YFYuanyuan Fang
Yuanyuan Fang
NXNaixing Xu
Naixing Xu
SHShihao Hou
Shihao Hou
XLXin Li
Xin Li
QLQian Li
Qian Li
Large language models (LLMs) have attracted a lot of attention in various fields due to their superior performance, aiming to train hundreds of millions or more parameters on large amounts of text data to understand and generate natural language. As the superior performance of LLMs becomes apparent, they are increasingly being applied to knowledge graph embedding (KGE)-related tasks to improve the processing results. Traditional KGE representation learning methods map entities and relations into a low-dimensional vector space, enabling the triples in the knowledge graph to satisfy a specific scoring function in the vector space. However, based on the powerful language understanding and semantic modeling capabilities of LLMs, which have recently been invoked to varying degrees in different types of KGE-related scenarios such as multi-modal KGE and open KGE according to their task characteristics, researchers are increasingly exploring how to integrate LLMs to enhance knowledge representation, improve generalization to unseen entities or relations, and support reasoning beyond static graph structures. In this paper, we investigate a wide range of approaches for performing LLMs-related tasks in different types of KGE scenarios. To better compare the various approaches, we summarize each KGE scenario in a classification. In the article we also discuss the applications in which the methods are mainly used and suggest several forward-looking directions for the development of this new research area.

1 January 2024
Verified
Conference Paper
Open access
PDF file
YLYongKang Liu
YongKang Liu
YZYiqun Zhang
Yiqun Zhang
QLQian Li
Qian Li
TLTong Liu
Tong Liu
SFShi Feng
Shi Feng
HSHinrich Schuetze
Hinrich Schuetze
YongKang Liu, Yiqun Zhang, Qian Li, Tong Liu, Shi Feng, Daling Wang, Yifei Zhang, Hinrich Schuetze. Proceedings of the 2024 Conference on Empirical Methods in Natural Language Processing. 2024.

2 November 2022 in IEEE Transactions on Knowledge and Data Engineering
Verified
Journal Article
Closed access
QLQian Li
Qian Li
DWDaling Wang
Daling Wang
SFShi Feng
Shi Feng
KSKaisong Song
Kaisong Song
YZYifei Zhang
Yifei Zhang
GYGe Yu
Ge Yu
The sparseness and incompleteness of knowledge graphs (KGs) trigger considerable interest in enhancing the representation learning with external corpora. However, the difficulty of aligning entities and relations with external corpora leads to inferior performance improvement. Open knowledge graphs (OKGs) consist of entity-mentions and relation-mentions that are represented by noncanonicalized freeform phrases, which generally do not rely on the specification of ontology schema. The roughness of the nonontological construction method leads to a specific characteristic of OKGs: diversity, where multiple entity-mentions (or relation-mentions) have the same meaning but different expressions. The diversity of OKGs can provide potential textual and structural features for the representation learning of KGs. We speculate that leveraging OKGs to enhance the representation learning of KGs can be more effective than using pure text or pure structure corpora. In this paper, we propose a new OERL , O pen knowledge graph E nhanced R epresentation L earning of KGs. OERL automatically extracts textual and structural connections between KGs and OKGs, models and transfers refined profitable features to enhance the representation learning of KGs. The strong performance improvement and exhaustive experimental analysis prove the superiority of OERL over state-of-the-art baselines.

5 May 2025 in Knowledge and Information Systems
Verified
Journal Article
Closed access
PDF file
NXNaixing Xu
Naixing Xu
QLQian Li
Qian Li
ZLZhaochuan Li
Zhaochuan Li
XWXu Wang
Xu Wang
BLBingchen Liu
Bingchen Liu
XLXin Li
Xin Li

20 February 2026 in Information Fusion
Verified
Journal Article
Closed access
YWYiming Wang
Yiming Wang
QLQian Li
Qian Li
YDYuntao Du
Yuntao Du
LCLizhen Cui
Lizhen Cui