Junlin Zhu
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Junlin Zhu has a total of 21 co-authors. Here are the top co-authors by number of shared publications:
- Yihao Zhang
School of Artificial Intelligence, Chongqing University of Technology, Chongqing, China
5 shared publications - Bo Fu
Laboratory of Intelligent Collaborative Computing, University of Electronic Science and Technology of China, Chengdu, China
3 shared publications - Jiahao Hu
School of Big Data & Software Engineering, Chongqing University, Chongqing, China
3 shared publications - Ruizhen Chen
School of Artificial Intelligence, Chongqing University of Technology, Chongqing, China
3 shared publications - Wei Zhou
School of Big Data and Software Engineering, Chongqing University, Chongqing, China
3 shared publications - Weiwen Liao
School of Artificial Intelligence, Chongqing University of Technology, Chongqing, China
3 shared publications
Latest Publications
- Open Access
- 19 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 579-589
Balanced Frequency Decoupling: Energy-Aware Multi-Scale Preference Modeling for Sequential Recommendation
- 19 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 579-589
Open AccessBalanced Frequency Decoupling: Energy-Aware Multi-Scale Preference Modeling for Sequential Recommendation
- Open Access
- 19 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 2578-2588
Towards Conflict-aware Selective Knowledge Unlearning for Continual Few-shot Knowledge Graph Completion
- 19 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 2578-2588
Open AccessTowards Conflict-aware Selective Knowledge Unlearning for Continual Few-shot Knowledge Graph Completion
- Open Access
- 19 June 2026
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Intelligent Systems and Technology
- Vol. 17 (5) , 1-25
CurvGCL: Mixed-Curvature Manifolds Graph Contrastive Learning for Knowledge-enhanced Recommendation
Recently, contrastive learning (CL) has gained significant traction in the recommendation field for its ability to extract stable signals from unsupervised data. However, practical applications often face challenges due to sparse and noisy data, limiting the effectiveness of CL in downstream tasks. Although knowledge graphs (KGs) offer valuable auxiliary information in such scenarios, they inherently possess significant non-Euclidean properties. Existing methods that embed data in a single constant curvature manifold can only accommodate specific graph structures, such as linear, hierarchical, or cyclic ones, making it challenging to model diverse and complex geometric topologies effectively. To address these limitations, we design CurvGCL, a novel graph contrastive learning framework that leverages mixed-curvature manifold representations to model complex geometric structures for knowledge-enhanced recommendation. Specifically, we propose a multi-manifolds adaptive fusion mechanism that preserves multiple geometric structures within KGs, enhancing their representation capabilities and allowing the integrated knowledge to adapt flexibly to various non-Euclidean geometric forms. Additionally, we design a novel method for adaptive-enhanced graph structure representation learning based on mixed-curvature manifold spaces, dynamically removing edges that are not relevant to recommendation during data augmentation, thereby generating high-quality views. Extensive experiments on four public datasets demonstrate that CurvGCL outperforms state-of-the-art methods.
- 19 June 2026
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Intelligent Systems and Technology
- Vol. 17 (5) , 1-25
Open AccessCurvGCL: Mixed-Curvature Manifolds Graph Contrastive Learning for Knowledge-enhanced Recommendation
Recently, contrastive learning (CL) has gained significant traction in the recommendation field for its ability to extract stable signals from unsupervised data. However, practical applications often face challenges due to sparse and noisy data, limiting the effectiveness of CL in downstream tasks. Although knowledge graphs (KGs) offer valuable auxiliary information in such scenarios, they inherently possess significant non-Euclidean properties. Existing methods that embed data in a single constant curvature manifold can only accommodate specific graph structures, such as linear, hierarchical, or cyclic ones, making it challenging to model diverse and complex geometric topologies effectively. To address these limitations, we design CurvGCL, a novel graph contrastive learning framework that leverages mixed-curvature manifold representations to model complex geometric structures for knowledge-enhanced recommendation. Specifically, we propose a multi-manifolds adaptive fusion mechanism that preserves multiple geometric structures within KGs, enhancing their representation capabilities and allowing the integrated knowledge to adapt flexibly to various non-Euclidean geometric forms. Additionally, we design a novel method for adaptive-enhanced graph structure representation learning based on mixed-curvature manifold spaces, dynamically removing edges that are not relevant to recommendation during data augmentation, thereby generating high-quality views. Extensive experiments on four public datasets demonstrate that CurvGCL outperforms state-of-the-art methods.
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computational Social Systems
- Vol. 13 (5) , 1-15
Frequency Meets Intent: Enhancing Sequential Recommendation With Spectral Contrastive Learning
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computational Social Systems
- Vol. 13 (5) , 1-15
Frequency Meets Intent: Enhancing Sequential Recommendation With Spectral Contrastive Learning
- Open Access
- 10 November 2025
- Published by Association for Computing Machinery (ACM)
- p. 4519-4528
DebiasedKGE: Towards Mitigating Spurious Forgetting in Continual Knowledge Graph Embedding
- 10 November 2025
- Published by Association for Computing Machinery (ACM)
- p. 4519-4528
Open AccessDebiasedKGE: Towards Mitigating Spurious Forgetting in Continual Knowledge Graph Embedding
- 12 August 2024
- Published by Elsevier in Information Sciences
- Vol. 686
MCKP: Multi-aspect contextual knowledge-enhanced prompting for conversational recommender systems
- 12 August 2024
- Published by Elsevier in Information Sciences
- Vol. 686
MCKP: Multi-aspect contextual knowledge-enhanced prompting for conversational recommender systems
- 23 July 2024
- Published by Springer Nature in Applied Intelligence
- Vol. 54 (20) , 9830-9847
Behavior sessions and time-aware for multi-target sequential recommendation
- 23 July 2024
- Published by Springer Nature in Applied Intelligence
- Vol. 54 (20) , 9830-9847
Behavior sessions and time-aware for multi-target sequential recommendation
- 13 April 2024
- Published by Springer Nature in World Wide Web
- Vol. 27 (3) , 1-26
Meta-path automatically extracted from heterogeneous information network for recommendation
- 13 April 2024
- Published by Springer Nature in World Wide Web
- Vol. 27 (3) , 1-26
Meta-path automatically extracted from heterogeneous information network for recommendation
- 2 February 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computational Social Systems
- Vol. 11 (3) , 4396-4411
Leveraging Hyperbolic Dynamic Neural Networks for Knowledge-Aware Recommendation
Knowledge graph (KG) is of growing significance in enabling explainable recommendations. Recent research works involve constructing propagation-based recommendation models. Nevertheless, most of the current propagation-based recommendation methods cannot explicitly handle the diverse relations of items, resulting in the inability to model the underlying hierarchies and diverse relations, and it is difficult to capture the high-order collaborative information of items to learn premium representation. To address these issues, we leverage hyperbolic dynamic neural networks for knowledge-aware recommendation (KHDNN). Technically speaking, we embed users and items (forming user–item bipartite graphs), along with entities and relations (constituting KGs), into hyperbolic space, followed by encoding these embeddings using an encoder. The encoded embedding is passed through a hyperbolic dynamic filter to explicitly handle relations and model different relational structures. Furthermore, we design a fresh aggregation strategy based on relations to propagate and capture higher-order collaborative signals as well as knowledge associations. Meanwhile, we extract semantic information via a bilateral memory network to fuse item collaborative signals and knowledge associations. Empirical results from four datasets show that KHDNN surpasses cutting-edge baseline methods. Additionally, we demonstrate that the KHDNN can perform knowledge-aware recommendations with complex relations.
- 2 February 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computational Social Systems
- Vol. 11 (3) , 4396-4411
Leveraging Hyperbolic Dynamic Neural Networks for Knowledge-Aware Recommendation
Knowledge graph (KG) is of growing significance in enabling explainable recommendations. Recent research works involve constructing propagation-based recommendation models. Nevertheless, most of the current propagation-based recommendation methods cannot explicitly handle the diverse relations of items, resulting in the inability to model the underlying hierarchies and diverse relations, and it is difficult to capture the high-order collaborative information of items to learn premium representation. To address these issues, we leverage hyperbolic dynamic neural networks for knowledge-aware recommendation (KHDNN). Technically speaking, we embed users and items (forming user–item bipartite graphs), along with entities and relations (constituting KGs), into hyperbolic space, followed by encoding these embeddings using an encoder. The encoded embedding is passed through a hyperbolic dynamic filter to explicitly handle relations and model different relational structures. Furthermore, we design a fresh aggregation strategy based on relations to propagate and capture higher-order collaborative signals as well as knowledge associations. Meanwhile, we extract semantic information via a bilateral memory network to fuse item collaborative signals and knowledge associations. Empirical results from four datasets show that KHDNN surpasses cutting-edge baseline methods. Additionally, we demonstrate that the KHDNN can perform knowledge-aware recommendations with complex relations.
- 12 October 2023
- Published by Springer Nature in Applied Intelligence
- Vol. 53 (23) , 28694-28710
Knowledge-enhanced multi-task recommendation in hyperbolic space
- 12 October 2023
- Published by Springer Nature in Applied Intelligence
- Vol. 53 (23) , 28694-28710
Knowledge-enhanced multi-task recommendation in hyperbolic space