Fuzhen Zhuang
Auto-generated profile, based on publicly available information

Fuzhen Zhuang

School of Artificial Intelligence, Beihang University, Beijing, China

Research Focus & Metrics

Academic Career Length

18Years (2009-Present)

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

Representative Publications

View All Publications
1 January 2021 in Proceedings of the IEEE
Verified
Journal Article
Closed access
FZFuzhen Zhuang
Fuzhen Zhuang
ZQZhiyuan Qi
Zhiyuan Qi
KDKeyu Duan
Keyu Duan
DXDongbo Xi
Dongbo Xi
YZYongchun Zhu
Yongchun Zhu
QHQing He
Qing He
Transfer learning aims at improving the performance of target learners on target domains by transferring the knowledge contained in different but related source domains. In this way, the dependence on a large number of target-domain data can be reduced for constructing target learners. Due to the wide application prospects, transfer learning has become a popular and promising area in machine learning. Although there are already some valuable and impressive surveys on transfer learning, these surveys introduce approaches in a relatively isolated way and lack the recent advances in transfer learning. Due to the rapid expansion of the transfer learning area, it is both necessary and challenging to comprehensively review the relevant studies. This survey attempts to connect and systematize the existing transfer learning research studies, as well as to summarize and interpret the mechanisms and the strategies of transfer learning in a comprehensive way, which may help readers have a better understanding of the current research status and ideas. Unlike previous surveys, this survey article reviews more than 40 representative transfer learning approaches, especially homogeneous transfer learning approaches, from the perspectives of data and model. The applications of transfer learning are also briefly introduced. In order to show the performance of different transfer learning models, over 20 representative transfer learning models are used for experiments. The models are performed on three different data sets, that is, Amazon Reviews, Reuters-21578, and Office-31, and the experimental results demonstrate the importance of selecting appropriate transfer learning models for different applications in practice.

13 May 2020 in IEEE Transactions on Neural Networks and Learning Systems
Verified
Journal Article
Closed access
YZYongchun Zhu
Yongchun Zhu
FZFuzhen Zhuang
Fuzhen Zhuang
JWJindong Wang
Jindong Wang
GKGuolin Ke
Guolin Ke
JCJingwu Chen
Jingwu Chen
QHQing He
Qing He
For a target task where the labeled data are unavailable, domain adaptation can transfer a learner from a different source domain. Previous deep domain adaptation methods mainly learn a global domain shift, i.e., align the global source and target distributions without considering the relationships between two subdomains within the same category of different domains, leading to unsatisfying transfer learning performance without capturing the fine-grained information. Recently, more and more researchers pay attention to subdomain adaptation that focuses on accurately aligning the distributions of the relevant subdomains. However, most of them are adversarial methods that contain several loss functions and converge slowly. Based on this, we present a deep subdomain adaptation network (DSAN) that learns a transfer network by aligning the relevant subdomain distributions of domain-specific layer activations across different domains based on a local maximum mean discrepancy (LMMD). Our DSAN is very simple but effective, which does not need adversarial training and converges fast. The adaptation can be achieved easily with most feedforward network models by extending them with LMMD loss, which can be trained efficiently via backpropagation. Experiments demonstrate that DSAN can achieve remarkable results on both object recognition tasks and digit classification tasks. Our code will be available at https://github.com/easezyc/deep-transfer-learning.

7 October 2020 in IEEE Transactions on Knowledge and Data Engineering
Verified
Journal Article
Closed access
QGQingyu Guo
Qingyu Guo
FZFuzhen Zhuang
Fuzhen Zhuang
CQChuan Qin
Chuan Qin
HZHengshu Zhu
Hengshu Zhu
XXXing Xie
Xing Xie
QHQing He
Qing He
To solve the information explosion problem and enhance user experience in various online applications, recommender systems have been developed to model users’ preferences. Although numerous efforts have been made toward more personalized recommendations, recommender systems still suffer from several challenges, such as data sparsity and cold-start problems. In recent years, generating recommendations with the knowledge graph as side information has attracted considerable interest. Such an approach can not only alleviate the above mentioned issues for a more accurate recommendation, but also provide explanations for recommended items. In this paper, we conduct a systematical survey of knowledge graph-based recommender systems. We collect recently published papers in this field, and group them into three categories, i.e., embedding-based methods, connection-based methods, and propagation-based methods. Also, we further subdivide each category according to the characteristics of these approaches. Moreover, we investigate the proposed algorithms by focusing on how the papers utilize the knowledge graph for accurate and explainable recommendation. Finally, we propose several potential research directions in this field.

6 July 2020 in IEEE Transactions on Knowledge and Data Engineering
Verified
Journal Article
Closed access
PZPengpeng Zhao
Pengpeng Zhao
ALAnjing Luo
Anjing Luo
YLYanchi Liu
Yanchi Liu
JXJiajie Xu
Jiajie Xu
ZLZhixu Li
Zhixu Li
XZXiaofang Zhou
Xiaofang Zhou
Next Point-of-Interest (POI) recommendation which is of great value to both users and POI holders is a challenging task since complex sequential patterns and rich contexts are contained in extremely sparse user check-in data. Recently proposed embedding techniques have shown promising results in alleviating the data sparsity issue by modeling context information, and Recurrent Neural Network (RNN) has been proved effective in the sequential prediction. However, existing next POI recommendation approaches train the embedding and network model separately, which cannot fully leverage rich contexts. In this paper, we propose a novel unified neural network framework, named NeuNext, which leverages POI context prediction to assist next POI recommendation by joint learning. Specifically, the Spatio-Temporal Gated Network (STGN) is proposed to model personalized sequential patterns for users’ long and short term preferences in the next POI recommendation. In the POI context prediction, rich contexts on POI sides are used to construct graph, and enforce the smoothness among neighboring POIs. Finally, we jointly train the POI context prediction and the next POI recommendation to fully leverage labeled and unlabeled data. Extensive experiments on real-world datasets show that our method outperforms other approaches for next POI recommendation in terms of Accuracy and MAP.

1 November 2019 in Neural Networks
Verified
Journal Article
Closed access
YZYongchun Zhu
Yongchun Zhu
FZFuzhen Zhuang
Fuzhen Zhuang
JWJindong Wang
Jindong Wang
JCJingwu Chen
Jingwu Chen
ZSZhiping Shi
Zhiping Shi
QHQing He
Qing He

18 July 2023
Verified
Conference Paper
Open access
XDXinyu Du
Xinyu Du
HYHuanhuan Yuan
Huanhuan Yuan
PZPengpeng Zhao
Pengpeng Zhao
JQJianfeng Qu
Jianfeng Qu
FZFuzhen Zhuang
Fuzhen Zhuang
VSVictor Sheng
Victor Sheng
The self-attention mechanism, which equips with a strong capability of modeling long-range dependencies, is one of the extensively used techniques in the sequential recommendation field. However, many recent studies represent that current self-attention based models are low-pass filters and are inadequate to capture high-frequency information. Furthermore, since the items in the user behaviors are intertwined with each other, these models are incomplete to distinguish the inherent periodicity obscured in the time domain. In this work, we shift the perspective to the frequency domain, and propose a novel Frequency Enhanced Hybrid Attention Network for Sequential Recommendation, namely FEARec. In this model, we firstly improve the original time domain self-attention in the frequency domain with a ramp structure to make both low-frequency and high-frequency information could be explicitly learned in our approach. Moreover, we additionally design a similar attention mechanism via auto-correlation in the frequency domain to capture the periodic characteristics and fuse the time and frequency level attention in a union model. Finally, both contrastive learning and frequency regularization are utilized to ensure that multiple views are aligned in both the time domain and frequency domain. Extensive experiments conducted on four widely used benchmark datasets demonstrate that the proposed model performs significantly better than the state-of-the-art approaches.