Wenjun Wu

Wenjun Wu


Research Focus & Metrics

Academic Career Length

15Years (2012-Present)

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

Representative Publications

View All Publications
1 January 2017 in Frontiers of Information Technology & Electronic Engineering
Verified
Journal Article
Closed access
PDF file
WLWei Li
Wei Li
Wenjun WuWenjun Wu
Wenjun Wu
HWHuai-Min Wang
Huai-Min Wang
XCXue-Qi Cheng
Xue-Qi Cheng
HCHua-Jun Chen
Hua-Jun Chen
RDRong Ding
Rong Ding
The Internet based cyber-physical world has profoundly changed the information environment for the development of artificial intelligence (AI), bringing a

14 August 2013 in Frontiers of Computer Science
Verified
Journal Article
Closed access
PDF file
Wenjun WuWenjun Wu
Wenjun Wu
WTWei-Tek Tsai
Wei-Tek Tsai
WLWei Li
Wei Li

4 February 2025 in IEEE Transactions on Knowledge and Data Engineering
Verified
Journal Article
Closed access
TPTianhao Peng
Tianhao Peng
HYHaitao Yuan
Haitao Yuan
YZYongqi Zhang
Yongqi Zhang
YLYuchen Li
Yuchen Li
PDPeihong Dai
Peihong Dai
Wenjun WuWenjun Wu
Wenjun Wu
Sequential recommendation systems aim to predict the future behaviors of users based on their historical interactions. Despite the success of neural architectures like Transformer and Graph Neural Networks, these models often struggle with the inherent challenge of sparse data in accurately predicting future user behaviors. To alleviate the data sparsity problem, some methods leverage the contrastive learning to generate contrastive views, assuming the items appear discretely at the same time intervals and focusing on the sequence order. However, these approaches neglect the crucial temporal-aware collaborative patterns hidden within the user-item interactions, leading to a limited variety of contrastive pairs and less informative embeddings. The proposed framework, Temporal-aware graph contrastive learning with theoretical guarantees for sequential Recommendation (TagRec), integrates temporal-aware collaborative patterns with adaptive data augmentation to generate more informative user and item representations. TagRec employs a temporal-aware graph neural network to embed the original graph, then generates augmented graphs through the addition of interactions via latent user interest mining, the dropping of redundant interaction edges, and the perturbation of temporal information. Theoretical guarantees are provided that these augmentations enhance the graph's utility. Extensive experiments on real-world datasets demonstrate the superiority of the proposed approach over the state-of-the-art recommendation methods.

9 May 2022 in Applied Intelligence
Verified
Journal Article
Closed access
PDF file
XYXiaoming Yu
Xiaoming Yu
Wenjun WuWenjun Wu
Wenjun Wu
XLXingchuang Liao
Xingchuang Liao
YHYong Han
Yong Han

13 October 2016 in Science China Information Sciences
Verified
Journal Article
Closed access
PDF file
YLYihua Lou
Yihua Lou
Wenjun WuWenjun Wu
Wenjun Wu
RVRadu-Daniel Vatavu
Radu-Daniel Vatavu
WTWei-Tek Tsai
Wei-Tek Tsai

26 April 2024 in ACM Transactions on Information Systems
Verified
Journal Article
Open access
YPYanjun Pu
Yanjun Pu
FLFang Liu
Fang Liu
RSRongye Shi
Rongye Shi
HYHaitao Yuan
Haitao Yuan
RCRuibo Chen
Ruibo Chen
Wenjun WuWenjun Wu
Wenjun Wu
Knowledge tracing models based on deep learning can achieve impressive predictive performance by leveraging attention mechanisms. However, there still exist two challenges in attentive knowledge tracing (AKT): First, the mechanism of classical models of AKT demonstrates relatively low attention when processing exercise sequences with shifting knowledge concepts (KC), making it difficult to capture the comprehensive state of knowledge across sequences. Second, classical models do not consider stochastic behaviors, which negatively affects models of AKT in terms of capturing anomalous knowledge states. This article proposes a model of AKT, called Enhancing Locality for Attentive Knowledge Tracing (ELAKT), that is a variant of the deep KT model. The proposed model leverages the encoder module of the transformer to aggregate knowledge embedding generated by both exercises and responses over all timesteps. In addition, it uses causal convolutions to aggregate and smooth the states of local knowledge. The ELAKT model uses the states of comprehensive KCs to introduce a prediction correction module to forecast the future responses of students to deal with noise caused by stochastic behaviors. The results of experiments demonstrated that the ELAKT model consistently outperforms state-of-the-art baseline KT models.