Yi Zhang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Yi Zhang has a total of 9 co-authors. Here are the top co-authors by number of shared publications:
- Guangyou Zhou
Central China Normal University
3 shared publications - Jimmy Xiangji Huang
Information Retrieval and Knowledge Management Research Lab, York University
2 shared publications - Zhiwen Xie
Central China Normal University
2 shared publications - Jin Liu
Wuhan University
1 shared publication Jinjin Ma
1 shared publication- Jinjin Ma
Faculty of Artificial Intelligence in Education, Central China Normal University, Wuhan, China
1 shared publication
Latest Publications
- 13 December 2025
- Published by Elsevier in Knowledge-Based Systems
- Vol. 334
LE-DLCM: Decoupled learner and course modeling with large language models for enhanced course recommendation
- 13 December 2025
- Published by Elsevier in Knowledge-Based Systems
- Vol. 334
LE-DLCM: Decoupled learner and course modeling with large language models for enhanced course recommendation
- Top Cited Papers
- 11 January 2025
- Published by Elsevier in Information Processing & Management
- Vol. 62 (3)
A diversity-enhanced knowledge distillation model for practical math word problem solving
- 11 January 2025
- Published by Elsevier in Information Processing & Management
- Vol. 62 (3)
Top Cited PapersA diversity-enhanced knowledge distillation model for practical math word problem solving
- 23 July 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Knowledge and Data Engineering
- Vol. 36 (12) , 8914-8927
One Subgraph for All: Efficient Reasoning on Opening Subgraphs for Inductive Knowledge Graph Completion
Knowledge Graph Completion (KGC) has garnered massive research interest recently, and most existing methods are designed following a transductive setting where all entities are observed during training. Despite the great progress on the transductive KGC, these methods struggle to conduct reasoning on emerging KGs involving unseen entities. Thus, inductive KGC, which aims to deduce missing links among unseen entities, has become a new trend. Many existing studies transform inductive KGC as a graph classification problem by extracting enclosing subgraphs surrounding each candidate triple. Unfortunately, they still face certain challenges, such as the expensive time consumption caused by the repeat extraction of enclosing subgraphs, and the deficiency of entity-independent feature learning. To address these issues, we propose a global-local anchor representation (GLAR) learning method for inductive KGC. Unlike previous methods that utilize enclosing subgraphs, we extract a shared opening subgraph for all candidates and perform reasoning on it, enabling the model to perform reasoning more efficiently. Moreover, we design some transferable global and local anchors to learn rich entity-independent features for emerging entities. Finally, a global-local graph reasoning model is applied on the opening subgraph to rank all candidates. Extensive experiments show that our GLAR outperforms most existing state-of-the-art methods.
- 23 July 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Knowledge and Data Engineering
- Vol. 36 (12) , 8914-8927
One Subgraph for All: Efficient Reasoning on Opening Subgraphs for Inductive Knowledge Graph Completion
Knowledge Graph Completion (KGC) has garnered massive research interest recently, and most existing methods are designed following a transductive setting where all entities are observed during training. Despite the great progress on the transductive KGC, these methods struggle to conduct reasoning on emerging KGs involving unseen entities. Thus, inductive KGC, which aims to deduce missing links among unseen entities, has become a new trend. Many existing studies transform inductive KGC as a graph classification problem by extracting enclosing subgraphs surrounding each candidate triple. Unfortunately, they still face certain challenges, such as the expensive time consumption caused by the repeat extraction of enclosing subgraphs, and the deficiency of entity-independent feature learning. To address these issues, we propose a global-local anchor representation (GLAR) learning method for inductive KGC. Unlike previous methods that utilize enclosing subgraphs, we extract a shared opening subgraph for all candidates and perform reasoning on it, enabling the model to perform reasoning more efficiently. Moreover, we design some transferable global and local anchors to learn rich entity-independent features for emerging entities. Finally, a global-local graph reasoning model is applied on the opening subgraph to rank all candidates. Extensive experiments show that our GLAR outperforms most existing state-of-the-art methods.