Yuanjie Zhu

dblp:207/7781 · DBLP profile ↗
← Back
5ranked-venue papers
0as first author
5since 2021 · last 2026
0009-0004-9852-3770ORCID · corroborated

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

Artificial intelligence and machine learning · 3 · 3 since 2021Databases, data management, data science and information retrieval · 3 · 3 since 2021Applied, interdisciplinary, general and emerging computing · 2 · 2 since 2021
YearPublicationVenuePosition
2026 Why LLMs Hallucinate on Structured Knowledge: A Mechanistic Analysis of Reasoning over Linearized Representations
abstract
Shanghao Li, Jinda Han, Yibo Wang, Yuanjie Zhu, Zihe Song, Langzhou He, Kenan Kamel A Alghythee, Philip S. Yu. Proceedings of the 64th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers). 2026.
Shanghao Li, Jinda Han, Yibo Wang 0001, Yuanjie Zhu, Zihe Song 0001, Langzhou He, Kenan Kamel A Alghythee, Philip S. Yu
ACL (1)4
2025 SGCL: Unifying Self-Supervised and Supervised Learning for Graph Recommendation
abstract
Recommender systems (RecSys) are essential for online platforms, providing personalized suggestions to users within a vast sea of information.Self-supervised graph learning seeks to harness highorder collaborative filtering signals through unsupervised augmentation on the user-item bipartite graph, primarily leveraging a multi-task learning framework that includes both supervised recommendation loss and self-supervised contrastive loss.However, this separate design introduces additional graph convolution processes and creates inconsistencies in gradient directions due to disparate losses, resulting in prolonged training times and sub-optimal performance.In this study, we introduce a unified framework of Supervised Graph Contrastive Learning for recommendation (SGCL) to address these issues.SGCL uniquely combines the training of recommendation and unsupervised contrastive losses into a cohesive supervised contrastive learning loss, aligning both tasks within a single optimization direction for exceptionally fast training.Extensive experiments on three real-world datasets show that SGCL outperforms state-of-the-art methods, achieving superior accuracy and efficiency.
Weizhi Zhang 0001, Liangwei Yang, Zihe Song 0001, Henry Peng Zou, Ke Xu 0018, Yuanjie Zhu, Philip S. Yu
RecSys6
2025 An Optimization Strategy Allowing a Tactile Glove With Minimal Tactile Sensors for Soft Object Identification
abstract
Humans can easily perceive the shapes and textures of grasped objects due to high-density mechanoreceptor networks in the hand. However, replicating this capability in wearable devices with limited sensors remains challenging. Here, we designed a tactile glove equipped with easily accessible sensors, enabling accurate identification of soft objects during grasping. We propose an optimization strategy to eliminate redundant sensors and determine the minimal sensor configuration, which was then integrated into the tactile glove. The results indicate that the minimal sensor configuration (n = 7) attached to the hand achieved accurate identification comparable to that obtained using a larger number of sensors (n = 22) distributed across the hand before elimination. Furthermore, we found that various machine learning classifiers achieved recognition accuracies of up to 90% for soft objects when using the tactile glove. Correlation analyses were conducted to characterize individual contribution and mutual cooperativity of regional tactile forces on the hand during grasping, aiding in the interpretation of sensor selection or elimination in the optimization strategy. Adequate validation and analysis demonstrate that our strategy allows an easy-to-apply solution for identifying soft objects via a tactile glove with a minimal number of sensors, offering valuable insights for guiding the design of tactile sensor layouts in artificial limbs and robotic teleoperation systems.
Xiaofeng Qiao, Yuanjie Zhu, Linyuan Fan, Songjun Du, Wanxin Zhang, Yifang Xiang, Yepu Chen, Jieyi Guo, Yubo Fan
IEEE J. Biomed. Health Informatics4
2023 Dual-Teacher Knowledge Distillation for Strict Cold-Start Recommendation
abstract
Recommender systems (RecSys) aim to predict users’ preferences based on historical interactions and content profiles, and they are vital components of many online services. However, the strict cold-start (SCS) issue, i.e., users/items have no prior interactions, poses significant challenges for RecSys. The existing methods seek to transfer content knowledge, collaborative filtering (CF) knowledge, or combine the two from the warm-start scenario towards the (strict) cold-start scenarios. However, these approaches either ignore the available information or model the information in rough manners such that the two types of knowledge interfere with each other, leading to ineffective and uncontrolled knowledge transfer. In this work, we propose a novel dual-teacher knowledge distillation (DTKD) framework that simultaneously and effectively transfers both content and CF knowledge. The proposed DTKD framework contains two teachers, one for each knowledge type, that is specifically designed according to the characteristics of the content and CF data to distill the knowledge fully. Soft scoring is calculated during the distillation to denoise and augment the original hard-labeled interactions. A knowledge fusion module is then proposed to collect the consensus of the two teachers’ opinions. Finally, DTKD transfers both content and CF knowledge into a student module that learns the shared viewpoints of the teachers. We conduct extensive experiments on real-world datasets under the warm-start as well as three different SCS settings (i.e., strict cold users, strict cold items, and strict cold users & items). Experimental results show that DTKD outperforms strong baselines by large margins under all settings, especially the SCS ones.
Weizhi Zhang 0001, Liangwei Yang, Yuwei Cao, Ke Xu 0018, Yuanjie Zhu, Philip S. Yu
IEEE Big Data5
2023 Graph Neural Ordinary Differential Equations-based method for Collaborative Filtering
abstract
Graph Convolution Networks (GCNs) are widely considered state-of-the-art for collaborative filtering. Although several GCN-based methods have been proposed and achieved state-of-the-art performance in various tasks, they can be computationally expensive and time-consuming to train if too many layers are created. However, since the linear GCN model can be interpreted as a differential equation, it is possible to transfer it to an ODE problem. This inspired us to address the computational limitations of GCN-based models by designing a simple and efficient NODE-based model that can skip some GCN layers to reach the final state, thus avoiding the need to create many layers. In this work, we propose a Graph Neural Ordinary Differential Equation-based method for Collaborative Filtering (GODE-CF). This method estimates the final embedding by utilizing the information captured by one or two GCN layers. To validate our approach, we conducted experiments on multiple datasets. The results demonstrate that our model outperforms competitive baselines, including GCN-based models and other state-of-the-art CF methods. Notably, our proposed GODE-CF model has several advantages over traditional GCN-based models. It is simple, efficient, and has a fast training time, making it a practical choice for real-world situations.
Ke Xu 0018, Yuanjie Zhu, Weizhi Zhang 0001, Philip S. Yu
ICDM2