Hengjing Xiang

Hengjing Xiang

Auto-generated profile, based on publicly available information

Hengjing Xiang

College of Computer Science and Artificial Intelligence, Fudan University, Shanghai, China

Research Focus & Metrics

Academic Career Length

3Years (2024-Present)

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

Representative Publications

View All Publications
13 December 2024 in IEEE Transactions on Industrial Informatics
Verified
Journal Article
Closed access
ZLZhi Liu
Zhi Liu
HXHengjing Xiang
Hengjing Xiang
RLRuxia Liang
Ruxia Liang
JXJinhai Xiang
Jinhai Xiang
CWChaodong Wen
Chaodong Wen
JSJianwen Sun
Jianwen Sun
In the field of recommender systems, self-supervised learning has become an effective framework. In response to the noisy interaction behaviors in realworld scenarios, as well as the skewed distribution influenced by data sparsity and popularity bias, graph contrastive learning has been introduced as a powerful self-supervised method in collaborative filtering (CF) to learn enhanced user and item representations. Despite their success, neither heuristic manual enhancement methods nor the use of final node representations to construct contrastive pairs are sufficient to provide effective and rich self-supervised signals to regulate the training process. Therefore, the learned representations of users and items are either fragile or lack heuristic guidance. In light of this, we propose the Hierarchical multiview graph contrastive learning framework HMCF, which leverages the message passing mechanism at the layer level to introduce different granularity levels of view augmentation using supervised signals, thus better enhancing the CF paradigm. HMCF leverages rich, high-quality self-supervised signals from different granularity views for accurate contrastive optimization, helping to alleviate data sparsity and noise issues. It also explains the hierarchical topology and relative distances between nodes in the original graph. Comprehensive experiments on three public datasets shows that our model significantly outperforms the state-of-the-art baselines.

11 December 2025 in IEEE Transactions on Industrial Informatics
Verified
Journal Article
Closed access
HXHengjing Xiang
Hengjing Xiang
YWYuan Wang
Yuan Wang
YXYanfeng Xu
Yanfeng Xu
SLSen Liu
Sen Liu
YFYang Fang
Yang Fang
GYGuangnan Ye
Guangnan Ye
In the field of recommender systems, graph neural networks (GNNs) have been extensively applied to collaborative filtering to generate personalized recommendations for users. To solve the problem of lack of observed data and contrasting interactions during representation learning, graph contrastive learning as an effective self-supervised learning (SSL) technique is presented to obtain augmented user and item representations. Nevertheless, most self-supervised approaches to generate recommendation either disrupt the graph structure or node embeddings through random augmentations or introduce augmented SSL information from biased data through heuristic methods. To overcome these challenges, we propose a learnable view augmentation model for collaborative filtering (LACF). Specifically, our framework embeds parameterized learnable view generators layer by layer into the automatic augmentation strategy, thus dynamically optimizing the adaptive augmented views of users and items through the backpropagation of weight gradients. In addition, LACF introduces a multiscale learning strategy that guides the view generator with layer-wise aware optimization and graph-level adaptive augmentation, enabling joint learning of representations with topological heterogeneity and semantic similarity from integrated viewpoint, achieving superior view augmentation. Extensive experiments on realworld datasets demonstrate that our LACF outperforms state-of-the-art baselines. In-depth analysis confirms the advantages of LACF in resistance against noise disturbances, alleviating data sparsity, and improving training efficiency.