Shanqing Yu

Shanqing Yu


Research Focus & Metrics

Academic Career Length

8Years (2019-Present)

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

Representative Publications

View All Publications
2 November 2022 in IEEE Transactions on Cognitive Communications and Networking
Verified
Journal Article
Closed access
TCTao Chen
Tao Chen
SGShuncheng Gao
Shuncheng Gao
SZShilian Zheng
Shilian Zheng
SYShanqing Yu
Shanqing Yu
QXQi Xuan
Qi Xuan
XYXiaoniu Yang
Xiaoniu Yang
Deep learning has been widely exploited in radio modulation recognition in recent years. In this paper, we exploit empirical mode decomposition (EMD) and variational mode decomposition (VMD) in deep learning-based radio modulation recognition. The received IQ sequences are decomposed by EMD or VMD and the decomposed components are spliced and fed into the designed deep neural network for classification. In order to reduce the computational complexity, we further propose to dowansample the decomposed components and input these downsampled components into the network for classification. Simulation results show that the proposed methods perform far better than other transform-based methods in terms of recognition accuracy. There is also performance gain of our proposed methods over IQ-based method and the performance gain is larger when using immature or shallow network architecture for classification or the recognition is in a few-shot scenario where only small number of training samples is available. Results also show that the proposed downsampling scheme can further improve the accuracy and reduce the computational complexity at the same time with a properly chosen downsampling factor.

8 August 2019 in IEEE Transactions on Knowledge and Data Engineering
Verified
Journal Article
Closed access
SYShanqing Yu
Shanqing Yu
MZMinghao Zhao
Minghao Zhao
CFChenbo Fu
Chenbo Fu
JZJun Zheng
Jun Zheng
HHHuimin Huang
Huimin Huang
GCGuanrong Chen
Guanrong Chen
In social networks, by removing some target-sensitive links, privacy protection might be achieved. However, some hidden links can still be re-observed by link prediction methods on observable networks. In this paper, the conventional link prediction method named Resource Allocation Index (RA) is adopted for privacy attacks. Several defense methods are proposed, including heuristic and evolutionary approaches, to protect targeted links from RA attack. In particular, incremental computation is proposed for accelerating the calculation of fitness in evolutionary approaches. This is the first time to study privacy protection for targeted links against similarity based link prediction attacks. Some links are randomly selected from original network as targeted links for experimentation. The experimental results on nine real-world networks demonstrate the superiority of the evolutionary perturbations, especially EDA, for defending against RA attack. Moreover, experimental results show that the proposed perturbation generated by EDA is transferable and can even defend against other link prediction attacks which are based on high order similarity between pairwise nodes, although it is designed to prevent RA attack.

30 March 2022 in IEEE Transactions on Computational Social Systems
Verified
Journal Article
Closed access
JCJinyin Chen
Jinyin Chen
GHGuohan Huang
Guohan Huang
HZHaibin Zheng
Haibin Zheng
SYShanqing Yu
Shanqing Yu
WJWenrong Jiang
Wenrong Jiang
CCChen Cui
Chen Cui
Graph neural network (GNN) has achieved great success on graph representation learning. Challenged by large-scale private data collected from user side, GNN may not be able to reflect the excellent performance, without rich features and complete adjacent relationships. Addressing the problem, vertical federated learning (VFL) is proposed to implement local data protection through training a global model collaboratively. Consequently, for graph-structured data, it is a natural idea to construct a GNN-based VFL (GVFL) framework. However, GNN has been proven vulnerable to adversarial attacks. Whether the vulnerability will be brought into the GVFL has not been studied. This is the first study of adversarial attacks on GVFL. A novel adversarial attack method is proposed, named Graph-Fraudster. It generates adversarial perturbations based on the noise-added global node embeddings via the privacy leakage and the gradient of pairwise node. Specifically, first, Graph-Fraudster steals the global node embeddings and sets up a shadow model of the server for the attack generator. Second, noise is added into node embeddings to confuse the shadow model. Finally, the gradient of pairwise node is used to generate attacks with the guidance of noise-added node embeddings. Extensive experiments on five benchmark datasets demonstrate that Graph-Fraudster achieves the state-of-the-art attack performance compared with baselines in different GNN based GVFLs. Furthermore, Graph-Fraudster can remain a threat to GVFL even if two possible defense mechanisms are applied. In addition, some suggestions are put forward for the future work to improve the robustness of GVFL. The code and datasets can be downloaded at https://github.com/hgh0545/Graph-Fraudster.

1 January 2021
Verified
Book Chapter
Closed access
PDF file
JSJie Shen
Jie Shen
JZJiajun Zhou
Jiajun Zhou
YXYunyi Xie
Yunyi Xie
SYShanqing Yu
Shanqing Yu
QXQi Xuan
Qi Xuan

1 January 2021
Verified
Book Chapter
Closed access
PDF file
SYShanqing Yu
Shanqing Yu
JJJie Jin
Jie Jin
YXYunyi Xie
Yunyi Xie
JSJie Shen
Jie Shen
QXQi Xuan
Qi Xuan

30 October 2020 in IEEE Transactions on Computational Social Systems
Verified
Journal Article
Closed access
JCJinyin Chen
Jinyin Chen
YCYixian Chen
Yixian Chen
HZHaibin Zheng
Haibin Zheng
SSShijing Shen
Shijing Shen
SYShanqing Yu
Shanqing Yu
QXQi Xuan
Qi Xuan
The adversarial attack methods based on gradient information can adequately find the perturbations, that is, the combinations of rewired links, thereby reducing the effectiveness of the deep learning model-based graph embedding algorithms, but it is also easy to fall into a local optimum. Therefore, this article proposes a momentum gradient attack (MGA) against the graph convolutional network (GCN) model, which can achieve more aggressive attacks with fewer rewiring links. Compared with directly updating the original network using gradient information, integrating the momentum term into the iterative process can stabilize the updating direction, which makes the model jump out of poor local optimum and enhances the method with stronger transferability. Experiments on node classification and community detection methods based on three well-known network embedding algorithms show that MGA has a better attack effect and transferability.