Wenzheng Feng

Wenzheng Feng

Auto-generated profile, based on publicly available information

Wenzheng Feng

Tsinghua University, Beijing, China

Research Focus & Metrics

Academic Career Length

6Years (2021-Present)

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

Representative Publications

View All Publications
4 August 2023
Verified
Conference Paper
Open access
Yifan ZhuYifan Zhu
Yifan Zhu
FCFangpeng Cong
Fangpeng Cong
DZDan Zhang
Dan Zhang
WGWenwen Gong
Wenwen Gong
Qika LinQika Lin
Qika Lin
JTJie Tang
Jie Tang
Modeling the dynamics into graph neural networks (GNNs) contributes to the understanding of evolution in dynamic graphs, which helps optimize temporal-spatial representations for real-world dynamic network problems. Empirically, dynamic GNN embedding requires additional temporal encoders, which inevitably introduces additional learning parameters to make dynamic GNNs oversized and inefficient. Furthermore, previous dynamic GNN models are under the same fixed temporal term, which causes the short-temporal optimum. To address these issues, we propose the WinGNN framework to model dynamic graphs, which is realized by a simple GNN model with the meta-learning strategy and a novel mechanism of random gradient aggregation. WinGNN calculates the frame-wise loss of the current snapshot and passes the loss gradient to the next to model graph dynamics without temporal encoders. Then it introduces the randomized sliding-window to acquire the window-aware gradienton consecutive snapshots, and the calculated two types of gradient are aggregated to update the GNN, thereby reducing the parameter size and improving the robustness. Experiments on six public datasets show the advantage of our WinGNN compared with existing baselines, where it has reached the optimum in twenty-two out of twenty-four performance metrics.

22 May 2023 in ACM Transactions on the Web
Verified
Journal Article
Open access
JGJibing Gong
Jibing Gong
YWYao Wan
Yao Wan
YLYe Liu
Ye Liu
XLXuewen Li
Xuewen Li
YZYi Zhao
Yi Zhao
JTJie Tang
Jie Tang
Massive open online courses (MOOCs), which offer open access and widespread interactive participation through the internet, are quickly becoming the preferred method for online and remote learning. Several MOOC platforms offer the service of course recommendation to users, to improve the learning experience of users. Despite the usefulness of this service, we consider that recommending courses to users directly may neglect their varying degrees of expertise. To mitigate this gap, we examine an interesting problem of concept recommendation in this paper, which can be viewed as recommending knowledge to users in a fine-grained way. We put forward a novel approach, termedHinCRec-RL, forConceptRecommendation in MOOCs, which is based onHeterogeneousInformationNetworks andReinforcementLearning. In particular, we propose to shape the problem of concept recommendation within a reinforcement learning framework to characterize the dynamic interaction between users and knowledge concepts in MOOCs. Furthermore, we propose to form the interactions among users, courses, videos, and concepts into aheterogeneous information network (HIN)to learn the semantic user representations better. We then employ an attentional graph neural network to represent the users in the HIN, based on meta-paths. Extensive experiments are conducted on a real-world dataset collected from a Chinese MOOC platform,XuetangX, to validate the efficacy of our proposed HinCRec-RL. Experimental results and analysis demonstrate that our proposed HinCRec-RL performs well when compared with several state-of-the-art models.

30 April 2023
Verified
Conference Paper
Open access
DZDan Zhang
Dan Zhang
Yifan ZhuYifan Zhu
Yifan Zhu
YDYuxiao Dong
Yuxiao Dong
YWYuandong Wang
Yuandong Wang
WFWenzheng Feng
Wenzheng Feng
JTJie Tang
Jie Tang
In recent years, graph neural networks (GNNs) have made great progress in recommendation. The core mechanism of GNNs-based recommender system is to iteratively aggregate neighboring information on the user-item interaction graph. However, existing GNNs treat users and items equally and cannot distinguish diverse local patterns of each node, which makes them suboptimal in the recommendation scenario. To resolve this challenge, we present a node-wise adaptive graph neural network framework ApeGNN. ApeGNN develops a node-wise adaptive diffusion mechanism for information aggregation, in which each node is enabled to adaptively decide its diffusion weights based on the local structure (e.g., degree). We perform experiments on six widely-used recommendation datasets. The experimental results show that the proposed ApeGNN is superior to the most advanced GNN-based recommender methods (up to 48.94%), demonstrating the effectiveness of node-wise adaptive aggregation.

26 April 2021 in Science China Information Sciences
Verified
Journal Article
Closed access
PDF file
ZSZhengyang Song
Zhengyang Song
JTJie Tang
Jie Tang
TLTracy Xiao Liu
Tracy Xiao Liu
WZWenjiang Zheng
Wenjiang Zheng
LWLili Wu
Lili Wu
JZJing Zhang
Jing Zhang

20 May 2026 in ACM Transactions on Knowledge Discovery From Data
Verified
Journal Article
Open access
XCXu Cheng
Xu Cheng
LYLiang Yao
Liang Yao
FHFeng He
Feng He
YCYukuo Cen
Yukuo Cen
YHYufei He
Yufei He
JTJie Tang
Jie Tang
Graph Neural Networks (GNNs) have emerged as powerful tools for various graph mining tasks, yet existing scalable solutions often struggle to balance execution efficiency with prediction accuracy. These difficulties stem from iterative message-passing techniques, which place significant computational demands and require extensive Graphics Processing Unit (GPU) memory, particularly when dealing with the neighbor explosion issue inherent in large-scale graphs. This article introduces a scalable, low-cost, flexible, and efficient GNN framework called LPS-GNN, which can perform representation learning on 100billion-edge graph with a single GPU in 10 hours and shows a 13.8% improvement in User Acquisition scenarios. We examine existing graph partitioning methods and design a superior graph partition algorithm named Label Propagation with METIS (LPMetis). In particular, LPMetis outperforms current state-of-the-art (SOTA) approaches on various evaluation metrics. In addition, our article proposes a subgraph augmentation strategy to enhance the model’s predictive performance. It exhibits excellent compatibility, allowing the entire framework to accommodate various GNN algorithms. Successfully deployed on the Tencent platform, LPS-GNN has been tested on public and real-world datasets, achieving performance lifts of 8.24% to 13.89% over SOTA models in online applications.

19 March 2026 in IEEE Transactions on Knowledge and Data Engineering
Verified
Journal Article
Closed access
WFWenzheng Feng
Wenzheng Feng
YDYuxiao Dong
Yuxiao Dong
SCShaosheng Cao
Shaosheng Cao
XCXu Cheng
Xu Cheng
JTJie Tang
Jie Tang
Heterogeneous graph neural networks (HGNNs) are effective for modeling multi-relational structured data. Existing HGNNs usually assume the training samples are relatively sufficient, thus focusing on improving the predictive performance by complicating the model architecture with more learnable parameters. In this paper, we instead explore how to design HGNNs when training labels are scarce, under which we observe that existing HGNNs suffer from serious overfitting issues. Inspired by the graph random neural network (GRAND)—a consistency regularization framework for graph learning, we propose a simple yet efficient R-GRAND framework to overcome the issues above. R-GRAND is a general relation-aware consistency regularized training method with both labeled and unlabeled nodes to facilitate the model’s generalization capability. It designs a lightweight relational graph convolution neural network (SRGC) as the backbone model to deal with the heterogeneous information. To enable regularized training, we further advance the data augmentation methods of GRAND with a Multi-block DropEdge strategy. The proposed training framework not only excels with its default SRGC backbone but also effectively enhances the performance of other HGNN architectures, such as RGCN and Simple-HGN. Extensive experiments on seven heterogeneous graph datasets demonstrate that R-GRAND can achieve remarkable performance improvements over state-of-the-art HGNNs with better generalization ability and high efficiency.