Shu Wu

Shu Wu

Auto-generated profile, based on publicly available information

Shu Wu

Institute of Automation, Chinese Academy of Sciences, Beijing, China

Research Focus & Metrics

Academic Career Length

12Years (2015-Present)

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

Representative Publications

View All Publications
14 November 2018 in IEEE Transactions on Knowledge and Data Engineering
Verified
Journal Article
Closed access
QCQiang Cui
Qiang Cui
SWShu Wu
Shu Wu
QLQiang Liu
Qiang Liu
WZWen Zhong
Wen Zhong
LWLiang Wang
Liang Wang
Sequential prediction is a fundamental task for network applications, and it usually suffers from the problem of item cold start. There are currently three kinds of popular approaches, but they have some limitations. Matrix factorization based methods could not capture dynamic user's interest. The strong Markov assumption greatly limits the performance of Markov chain based sequential methods. Recurrent neural networks incorporate additional information in a separate way. In this work, to make the sequential prediction and deal with the item cold start problem, we propose a Multi-View Rrecurrent Neural Network (MV-RNN). Given the latent feature, MV-RNN can alleviate the item cold start problem by incorporating visual and textual information. First, At the input of MV-RNN, three different combinations of multi-view features are studied, like concatenation, fusion by addition and fusion by reconstructing the original multi-modal data. Second, we design a separate structure and a united structure on the hidden state of MV-RNN to explore a more effective way to handle multi-view features. Experiments on two real-world datasets show that MV-RNN can effectively generate the personalized ranking list, tackle the missing modalities problem and significantly alleviate the item cold start problem.

14 November 2022 in IEEE Transactions on Knowledge and Data Engineering
Verified
Journal Article
Closed access
JZJinghao Zhang
Jinghao Zhang
YZYanqiao Zhu
Yanqiao Zhu
QLQiang Liu
Qiang Liu
MZMengqi Zhang
Mengqi Zhang
SWShu Wu
Shu Wu
LWLiang Wang
Liang Wang
Multimedia contents are of predominance in the modern Web era. Recent years have witnessed growing research interests in multimedia recommendation, which aims to predict whether a user will interact with an item with multimodal contents. Most previous studies focus on modeling user-item interactions with multimodal features included as side information. However, this scheme is not well-designed for multimedia recommendation. First, only collaborative item-item relationships are implicitly modeled through high-order item-user-item co-occurrences. Considering that items are associated with rich contents in multiple modalities, we argue that the latent semantic item-item structures underlying these multimodal contents could be beneficial for learning better item representations and assist the recommender models to comprehensively discover candidate items. Second, although previous studies consider multiple modalities, their ways of fusing multiple modalities by linear combination or concatenation is insufficient to fully capture content information of items and item relationships. To address these deficiencies, we propose a latent structure MI ning with C ont R astive m O dality fusion model, which we term MICRO for brevity. To be specific, we devise a novel modality-aware structure learning module, which learns item-item relationships for each modality. Based on the learned modality-aware latent item relationships, we perform graph convolutions to explicitly inject item affinities into modality-aware item representations. Additionally, we design a novel multimodal contrastive framework to facilitate item-level multimodal fusion by mining both modality-shared and modality-specific information. Finally, the item representations are plugged into existing collaborative filtering methods to make accurate recommendation. Extensive experiments on three real-world datasets demonstrate the superiority of our method over state-of-arts and rationalize the design choice of our work.

15 October 2020 in IEEE Transactions on Knowledge and Data Engineering
Verified
Journal Article
Closed access
MZMengqi Zhang
Mengqi Zhang
SWShu Wu
Shu Wu
MGMeng Gao
Meng Gao
Xin JiangXin Jiang
Xin Jiang
KXKe Xu
Ke Xu
LWLiang Wang
Liang Wang
The problem of session-aware recommendation aims to predict users’ next click based on their current session and historical sessions. Existing session-aware recommendation methods have defects in capturing complex item transition relationships. Other than that, most of them fail to explicitly distinguish the effects of different historical sessions on the current session. To this end, we propose a novel method, named Personalized Graph Neural Networks with Attention Mechanism (A-PGNN) for brevity. A-PGNN mainly consists of two components: one is Personalized Graph Neural Network (PGNN), which is used to extract the personalized structural information in each user behavior graph, compared with the traditional Graph Neural Network (GNN) model, which considers the role of the user when the node embedding is updated. The other is Dot-Product Attention mechanism, which draws on the Transformer net to explicitly model the effect of historical sessions on the current session. Extensive experiments conducted on two real-world data sets show that A-PGNN evidently outperforms the state-of-the-art personalized session-aware recommendation methods.

30 April 2023
Verified
Conference Paper
Open access
MZMengqi Zhang
Mengqi Zhang
YXYuwei Xia
Yuwei Xia
QLQiang Liu
Qiang Liu
SWShu Wu
Shu Wu
LWLiang Wang
Liang Wang
Temporal Knowledge graph (TKG) reasoning aims to predict missing facts based on historical TKG data. Most of the existing methods are incapable of explicitly modeling the long-term time dependencies from history and neglect the adaptive integration of the long- and short-term information. To tackle these problems, we propose a novel method that utilizes a designed Hierarchical Relational Graph Neural Network to learn the Long- and Short-term representations for TKG reasoning, namely HGLS. Specifically, to explicitly associate entities in different timestamps, we first transform the TKG into a global graph. Based on the built graph, we design a Hierarchical Relational Graph Neural Network that executes in two levels: The sub-graph level is to capture the semantic dependencies within concurrent facts of each KG. And the global-graph level aims to model the temporal dependencies between entities. Furthermore, we design a module to extract the long- and short-term information from the output of these two levels. Finally, the long- and short-term representations are fused into a unified one by Gating Integration for entity prediction. Extensive experiments on four datasets demonstrate the effectiveness of HGLS.

12 December 2023 in IEEE Transactions on Knowledge and Data Engineering
Verified
Journal Article
Closed access
JWJunfei Wu
Junfei Wu
WXWeizhi Xu
Weizhi Xu
QLQiang Liu
Qiang Liu
SWShu Wu
Shu Wu
LWLiang Wang
Liang Wang
The prevalence and perniciousness of fake news have been a critical issue on the Internet, which stimulates the development of automatic fake news detection in turn. In this paper, we focus on the evidence-based fake news detection, where several evidences are utilized to probe the veracity of news (i.e., a claim). Most previous methods first employ sequential models to embed the semantic information and then capture the claim-evidence interaction based on different attention mechanisms. Despite their effectiveness, they still suffer from three weaknesses. First, due to the inherent drawbacks of sequential models, they fail to integrate the relevant information that is scattered far apart in evidences for veracity checking. Second, they underestimate much redundant information contained in evidences that may be useless or even harmful. Third, insufficient data utilization limits the separability and reliability of representations captured by the model, which are sensitive to local evidence. To solve these problems, we propose a unified G raph-based s E mantic structure mining framework with Con TRA stive L earning, namely GETRAL in short. Specifically, different from the existing work that treats claims and evidences as sequences, we first model them as graph-structured data and capture the long-distance semantic dependency among dispersed relevant snippets via neighborhood propagation. After obtaining contextual semantic information, our model reduces information redundancy by performing graph structure learning. Then the fine-grained semantic representations are fed into the downstream claim-evidence interaction module for predictions. Finally, the supervised contrastive learning accompanied with adversarial augmented instances is applied to make full use of data and strengthen the representation learning. Comprehensive experiments have demonstrated the superiority of GETRAL over the state-of-the-arts and validated the efficacy of semantic mining with graph structure and contrastive learning.

20 October 2022 in IEEE Transactions on Neural Networks and Learning Systems
Verified
Journal Article
Closed access
ZCZeyu Cui
Zeyu Cui
ZLZekun Li
Zekun Li
SWShu Wu
Shu Wu
XZXiao-Yu Zhang
Xiao-Yu Zhang
QLQiang Liu
Qiang Liu
MAMengmeng Ai
Mengmeng Ai
Graph embedding, aiming to learn low-dimensional representations (aka. embeddings) of nodes in graphs, has received significant attention. In recent years, there has been a surge of efforts, among which graph convolutional networks (GCNs) have emerged as an effective class of models. However, these methods mainly focus on the static graph embedding. In the present work, an efficient dynamic graph embedding approach is proposed, called dynamic GCN (DyGCN), which is an extension of the GCN-based methods. The embedding propagation scheme of GCN is naturally generalized to a dynamic setting in an efficient manner, which propagates the change in topological structure and neighborhood embeddings along the graph to update the node embeddings. The most affected nodes are updated first, and then their changes are propagated to further nodes, which in turn are updated. Extensive experiments on various dynamic graphs showed that the proposed model can update the node embeddings in a time-saving and performance-preserving way.