Yongjing Hao

Yongjing Hao

Auto-generated profile, based on publicly available information

Yongjing Hao

Soochow University

Research Focus & Metrics

Academic Career Length

5Years (2022-Present)

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

Representative Publications

View All Publications
6 March 2023 in IEEE Transactions on Knowledge and Data Engineering
Verified
Journal Article
Closed access
YHYongjing Hao
Yongjing Hao
TZTingting Zhang
Tingting Zhang
PZPengpeng Zhao
Pengpeng Zhao
YLYanchi Liu
Yanchi Liu
VSVictor Sheng
Victor Sheng
XZXiaofang Zhou
Xiaofang Zhou
Sequential recommendation, which aims to recommend next item that the user will likely interact in a near future, has become essential in various Internet applications. Existing methods usually consider the transition patterns between items, but ignore the transition patterns between features of items. We argue that only the item-level sequences cannot reveal the full sequential patterns, while explicit and implicit feature-level sequences can help extract the full sequential patterns. Meanwhile, the item-level sequential recommendation also suffers from limited supervised signal issues. In this article, we propose a novel model Feature-level Deeper Self-Attention Network with Contrastive Learning (FDSA-CL) for sequential recommendation. Specifically, FDSA-CL first integrates various heterogeneous features of items into feature-level sequences with different weights through a vanilla attention mechanism. After that, FDSA-CL applies separated self-attention blocks on item-level sequences and feature-level sequences, respectively, to model item transition patterns and feature transition patterns. Moreover, we propose contrastive learning and item feature recommendation tasks to capture the embedding commonality and further utilize the beneficial interaction among the two levels, so as to alleviate the sparsity of the supervised signal and extract the most critical information. Finally, we jointly optimize the above tasks. We evaluate the proposed model using two real-world datasets and experimental results show that our model significantly outperforms the state-of-the-art approaches.

6 March 2023 in Pattern Recognition
Verified
Journal Article
Closed access
YHYongjing Hao
Yongjing Hao
JMJun Ma
Jun Ma
PZPengpeng Zhao
Pengpeng Zhao
GLGuanfeng Liu
Guanfeng Liu
XXXuefeng Xian
Xuefeng Xian
VSVictor S. Sheng
Victor S. Sheng

9 November 2023 in IEEE Transactions on Knowledge and Data Engineering
Verified
Journal Article
Closed access
YHYongjing Hao
Yongjing Hao
PZPengpeng Zhao
Pengpeng Zhao
XXXuefeng Xian
Xuefeng Xian
Guanfeng LiuGuanfeng Liu
Guanfeng Liu
LZLei Zhao
Lei Zhao
XZXiaofang Zhou
Xiaofang Zhou
Sequential Recommendation (SR) methods play a crucial role in recommender systems, which aims to capture users’ dynamic interest from their historical interactions. Recently, Contrastive Learning (CL), which has emerged as a successful method for sequential recommendation, utilizes various data augmentations to generate contrastive views to mine supervised signals from data to alleviate data sparsity issues. However, most existing sequential data augmentation methods may destroy semantic sequential interaction characteristics. Meanwhile, they often adopt random operations when generating contrastive views leading to suboptimal performance. To this end, in this paper, we propose a L earnable M odel A ugmentation Contrastive learning for sequential Rec ommendation (LMA4Rec) . Specifically, LMA4Rec first takes the model-based augmentation method to generate constructive views. Then, LMA4Rec uses Learnable Bernoulli Dropout (LBD) to implement learnable model augmentation operations. Next, contrastive learning is used between the contrastive views to extract supervised signals. Furthermore, a novel multi-positive contrastive learning loss alleviates the supervised sparsity issue. Finally, experiments on public datasets show that our LMA4Rec method effectively improved sequential recommendation performance compared with the state-of-the-art baseline methods.

19 June 2024 in ACM Transactions on Knowledge Discovery From Data
Verified
Journal Article
Open access
XLXinru Liu
Xinru Liu
YHYongjing Hao
Yongjing Hao
LZLei Zhao
Lei Zhao
Guanfeng LiuGuanfeng Liu
Guanfeng Liu
VSVictor Sheng
Victor Sheng
PZPengpeng Zhao
Pengpeng Zhao
Graph collaborative filtering (GCF) has achieved exciting recommendation performance with its ability to aggregate high-order graph structure information. Recently, contrastive learning (CL) has been incorporated into GCF to alleviate data sparsity and noise issues. However, most of the existing methods employ random or manual augmentation to produce contrastive views that may destroy the original topology and amplify the noisy effects. We argue that such augmentation is insufficient to produce the optimal contrastive view, leading to suboptimal recommendation results. In this article, we proposed a L earnable M odel A ugmentation C ontrastive L earning (LMACL) framework for recommendation, which effectively combines graph-level and node-level collaborative relations to enhance the expressiveness of collaborative filtering (CF) paradigm. Specifically, we first use the graph convolution network (GCN) as a backbone encoder to incorporate multi-hop neighbors into graph-level original node representations by leveraging the high-order connectivity in user-item interaction graphs. At the same time, we treat the multi-head graph attention network (GAT) as an augmentation view generator to adaptively generate high-quality node-level augmented views. Finally, joint learning endows the end-to-end training fashion. In this case, the mutual supervision and collaborative cooperation of GCN and GAT achieves learnable model augmentation. Extensive experiments on several benchmark datasets demonstrate that LMACL provides a significant improvement over the strongest baseline in terms of Recall and NDCG by 2.5%–3.8% and 1.6%–4.0%, respectively. Our model implementation code is available at https://github.com/LiuHsinx/LMACL .

11 April 2023 in ACM Transactions on Knowledge Discovery From Data
Verified
Journal Article
Open access
YLYunyi Li
Yunyi Li
YHYongjing Hao
Yongjing Hao
PZPengpeng Zhao
Pengpeng Zhao
Guanfeng LiuGuanfeng Liu
Guanfeng Liu
YLYanchi Liu
Yanchi Liu
XZXiaofang Zhou
Xiaofang Zhou
Sequential recommendation has been a widely popular topic of recommender systems. Existing works have contributed to enhancing the prediction ability of sequential recommendation systems based on various methods, such as recurrent networks and self-attention mechanisms. However, they fail to discover and distinguish various relationships between items, which could be underlying factors which motivate user behaviors. In this article, we propose an Edge-Enhanced Global Disentangled Graph Neural Network (EGD-GNN) model to capture the relation information between items for global item representation and local user intention learning. At the global level, we build a global-link graph over all sequences to model item relationships. Then a channel-aware disentangled learning layer is designed to decompose edge information into different channels, which can be aggregated to represent the target item from its neighbors. At the local level, we apply a variational auto-encoder framework to learn user intention over the current sequence. We evaluate our proposed method on three real-world datasets. Experimental results show that our model can get a crucial improvement over state-of-the-art baselines and is able to distinguish item features.

21 October 2024
Verified
Conference Paper
Open access
YHYongjing Hao
Yongjing Hao
FZFuzhen Zhuang
Fuzhen Zhuang
DWDeqing Wang
Deqing Wang
Guanfeng LiuGuanfeng Liu
Guanfeng Liu
VSVictor Sheng
Victor Sheng
PZPengpeng Zhao
Pengpeng Zhao
Recommender systems play a crucial role in delivering personalized services to users, but the increasing volume of user data raises significant concerns about privacy, security, and utility. However, existing machine unlearning methods cannot be directly applied to recommendation systems as they overlook the collaborative information shared across users and items. More recently, a method known as RecEraser was introduced, offering partitioning and aggregation-based approaches. Nevertheless, these approaches have limitations due to their inadequate handling of additional overhead costs. In this paper, we propose A General Strategy Graph Collaborative Filtering for Recommendation Unlearning (GSGCF-RU), which is a novel model-agnostic learnable delete operator that optimizes unlearning edge consistency and feature representation consistency. Specifically, the GSGCF-RU model utilizes unlearning edge consistency to eliminate the influence of deleted elements, followed by feature representation consistency to retain knowledge after deletion. Lastly, experimental results on three real-world public benchmarks demonstrate that GSGCF-RU not only achieves efficient recommendation unlearning but also surpasses state-of-the-art methods in terms of model utility. The source code can be found at https://github.com/YongjingHao/GSGCF-RU.